./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:58:43,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:58:43,560 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:58:43,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:58:43,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:58:43,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:58:43,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:58:43,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:58:43,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:58:43,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:58:43,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:58:43,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:58:43,619 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:58:43,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:58:43,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:58:43,620 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:58:43,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:58:43,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:58:43,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:58:43,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:58:43,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:58:43,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:58:43,623 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:58:43,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:58:43,624 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:58:43,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:58:43,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:58:43,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:58:43,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:58:43,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:58:43,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:58:43,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:58:43,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:58:43,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:58:43,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:58:43,637 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:58:43,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:58:43,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:58:43,638 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:58:43,638 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad [2023-11-19 07:58:44,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:58:44,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:58:44,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:58:44,043 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:58:44,043 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:58:44,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-11-19 07:58:47,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:58:47,395 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:58:47,396 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-11-19 07:58:47,409 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/data/a1fd4b91d/7f4a881e57b743e5afb1b955aaa0853c/FLAGbe39747ec [2023-11-19 07:58:47,429 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/data/a1fd4b91d/7f4a881e57b743e5afb1b955aaa0853c [2023-11-19 07:58:47,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:58:47,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:58:47,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:58:47,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:58:47,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:58:47,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0fd70b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47, skipping insertion in model container [2023-11-19 07:58:47,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,501 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:58:47,637 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2023-11-19 07:58:47,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:58:47,736 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:58:47,747 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2023-11-19 07:58:47,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:58:47,814 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:58:47,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47 WrapperNode [2023-11-19 07:58:47,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:58:47,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:58:47,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:58:47,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:58:47,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,884 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2023-11-19 07:58:47,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:58:47,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:58:47,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:58:47,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:58:47,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:58:47,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:58:47,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:58:47,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:58:47,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:58:47,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:58:47,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:58:47,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:58:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:58:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:58:48,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:58:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:58:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:58:48,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:58:48,147 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:58:48,150 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:58:48,599 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:58:48,608 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:58:48,608 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:58:48,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:48 BoogieIcfgContainer [2023-11-19 07:58:48,613 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:58:48,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:58:48,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:58:48,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:58:48,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:58:47" (1/3) ... [2023-11-19 07:58:48,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be01712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:48, skipping insertion in model container [2023-11-19 07:58:48,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47" (2/3) ... [2023-11-19 07:58:48,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be01712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:48, skipping insertion in model container [2023-11-19 07:58:48,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:48" (3/3) ... [2023-11-19 07:58:48,626 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-11-19 07:58:48,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:58:48,648 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:58:48,713 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:58:48,721 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e200b61, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:58:48,722 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:58:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-19 07:58:48,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:48,750 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:48,751 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:48,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:48,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1871924999, now seen corresponding path program 1 times [2023-11-19 07:58:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:48,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905254710] [2023-11-19 07:58:48,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:48,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:49,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:49,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905254710] [2023-11-19 07:58:49,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905254710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:49,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:49,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:58:49,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142690496] [2023-11-19 07:58:49,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:49,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:58:49,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:49,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:58:49,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:58:49,304 INFO L87 Difference]: Start difference. First operand has 69 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:58:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:49,348 INFO L93 Difference]: Finished difference Result 135 states and 219 transitions. [2023-11-19 07:58:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:58:49,350 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 116 [2023-11-19 07:58:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:49,360 INFO L225 Difference]: With dead ends: 135 [2023-11-19 07:58:49,361 INFO L226 Difference]: Without dead ends: 65 [2023-11-19 07:58:49,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:58:49,372 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:49,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:58:49,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-19 07:58:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-19 07:58:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2023-11-19 07:58:49,422 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 116 [2023-11-19 07:58:49,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:49,423 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2023-11-19 07:58:49,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:58:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2023-11-19 07:58:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-19 07:58:49,427 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:49,427 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:49,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:58:49,428 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:49,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:49,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1168316485, now seen corresponding path program 1 times [2023-11-19 07:58:49,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:49,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084597522] [2023-11-19 07:58:49,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:49,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:49,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:49,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084597522] [2023-11-19 07:58:49,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084597522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:49,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:49,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:58:49,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036423516] [2023-11-19 07:58:49,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:49,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:58:49,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:49,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:58:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:49,785 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:49,846 INFO L93 Difference]: Finished difference Result 154 states and 229 transitions. [2023-11-19 07:58:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:58:49,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2023-11-19 07:58:49,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:49,850 INFO L225 Difference]: With dead ends: 154 [2023-11-19 07:58:49,850 INFO L226 Difference]: Without dead ends: 92 [2023-11-19 07:58:49,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:49,853 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 30 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:49,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 192 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:58:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-19 07:58:49,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2023-11-19 07:58:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 113 transitions. [2023-11-19 07:58:49,869 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 113 transitions. Word has length 116 [2023-11-19 07:58:49,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:49,871 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 113 transitions. [2023-11-19 07:58:49,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 113 transitions. [2023-11-19 07:58:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-19 07:58:49,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:49,874 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:49,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:58:49,875 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:49,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:49,875 INFO L85 PathProgramCache]: Analyzing trace with hash -455841797, now seen corresponding path program 1 times [2023-11-19 07:58:49,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:49,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662846904] [2023-11-19 07:58:49,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:50,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:50,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662846904] [2023-11-19 07:58:50,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662846904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:50,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:50,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:58:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820313395] [2023-11-19 07:58:50,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:50,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:58:50,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:50,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:58:50,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:58:50,725 INFO L87 Difference]: Start difference. First operand 76 states and 113 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:51,145 INFO L93 Difference]: Finished difference Result 250 states and 373 transitions. [2023-11-19 07:58:51,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:58:51,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2023-11-19 07:58:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:51,156 INFO L225 Difference]: With dead ends: 250 [2023-11-19 07:58:51,156 INFO L226 Difference]: Without dead ends: 177 [2023-11-19 07:58:51,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:58:51,166 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 173 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:51,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 336 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:58:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-19 07:58:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2023-11-19 07:58:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 77 states have internal predecessors, (111), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 143 transitions. [2023-11-19 07:58:51,203 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 143 transitions. Word has length 116 [2023-11-19 07:58:51,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:51,207 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 143 transitions. [2023-11-19 07:58:51,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 143 transitions. [2023-11-19 07:58:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-19 07:58:51,210 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:51,211 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:51,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:58:51,211 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:51,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:51,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1735705475, now seen corresponding path program 1 times [2023-11-19 07:58:51,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:51,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276814402] [2023-11-19 07:58:51,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:51,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:51,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276814402] [2023-11-19 07:58:51,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276814402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:51,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:51,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:58:51,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353355254] [2023-11-19 07:58:51,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:51,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:58:51,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:51,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:58:51,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:58:51,831 INFO L87 Difference]: Start difference. First operand 95 states and 143 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:52,201 INFO L93 Difference]: Finished difference Result 248 states and 370 transitions. [2023-11-19 07:58:52,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:58:52,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2023-11-19 07:58:52,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:52,206 INFO L225 Difference]: With dead ends: 248 [2023-11-19 07:58:52,206 INFO L226 Difference]: Without dead ends: 156 [2023-11-19 07:58:52,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:58:52,218 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 83 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:52,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 547 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:58:52,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-19 07:58:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 107. [2023-11-19 07:58:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 160 transitions. [2023-11-19 07:58:52,242 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 160 transitions. Word has length 116 [2023-11-19 07:58:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:52,242 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 160 transitions. [2023-11-19 07:58:52,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 160 transitions. [2023-11-19 07:58:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:58:52,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:52,249 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:52,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:58:52,250 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:52,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:52,250 INFO L85 PathProgramCache]: Analyzing trace with hash -116018576, now seen corresponding path program 1 times [2023-11-19 07:58:52,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:52,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816276528] [2023-11-19 07:58:52,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:52,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:52,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:52,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816276528] [2023-11-19 07:58:52,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816276528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:52,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:52,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:58:52,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145081373] [2023-11-19 07:58:52,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:52,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:58:52,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:52,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:58:52,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:58:52,874 INFO L87 Difference]: Start difference. First operand 107 states and 160 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:53,375 INFO L93 Difference]: Finished difference Result 282 states and 408 transitions. [2023-11-19 07:58:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:58:53,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-11-19 07:58:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:53,379 INFO L225 Difference]: With dead ends: 282 [2023-11-19 07:58:53,380 INFO L226 Difference]: Without dead ends: 178 [2023-11-19 07:58:53,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:58:53,382 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 99 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:53,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 456 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:58:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-19 07:58:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 112. [2023-11-19 07:58:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2023-11-19 07:58:53,398 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 117 [2023-11-19 07:58:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:53,398 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2023-11-19 07:58:53,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2023-11-19 07:58:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:58:53,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:53,401 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:53,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:58:53,401 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:53,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:53,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1082498701, now seen corresponding path program 1 times [2023-11-19 07:58:53,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:53,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485925355] [2023-11-19 07:58:53,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:53,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:53,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:53,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485925355] [2023-11-19 07:58:53,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485925355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:53,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:53,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:58:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947676974] [2023-11-19 07:58:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:53,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:58:53,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:53,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:58:53,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:53,556 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:53,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:53,610 INFO L93 Difference]: Finished difference Result 275 states and 391 transitions. [2023-11-19 07:58:53,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:58:53,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2023-11-19 07:58:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:53,613 INFO L225 Difference]: With dead ends: 275 [2023-11-19 07:58:53,613 INFO L226 Difference]: Without dead ends: 166 [2023-11-19 07:58:53,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:53,614 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 74 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:53,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 190 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:58:53,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-19 07:58:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 105. [2023-11-19 07:58:53,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:53,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 149 transitions. [2023-11-19 07:58:53,625 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 149 transitions. Word has length 117 [2023-11-19 07:58:53,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:53,626 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 149 transitions. [2023-11-19 07:58:53,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:53,626 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 149 transitions. [2023-11-19 07:58:53,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:58:53,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:53,628 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:53,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:58:53,628 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:53,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:53,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1713542211, now seen corresponding path program 1 times [2023-11-19 07:58:53,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:53,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464862613] [2023-11-19 07:58:53,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:53,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464862613] [2023-11-19 07:58:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464862613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:54,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:54,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:58:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530669513] [2023-11-19 07:58:54,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:54,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:58:54,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:54,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:58:54,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:58:54,110 INFO L87 Difference]: Start difference. First operand 105 states and 149 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:54,568 INFO L93 Difference]: Finished difference Result 273 states and 376 transitions. [2023-11-19 07:58:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:58:54,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-19 07:58:54,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:54,571 INFO L225 Difference]: With dead ends: 273 [2023-11-19 07:58:54,571 INFO L226 Difference]: Without dead ends: 171 [2023-11-19 07:58:54,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:58:54,573 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 86 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:54,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 583 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:58:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-19 07:58:54,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 103. [2023-11-19 07:58:54,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:54,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2023-11-19 07:58:54,581 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 118 [2023-11-19 07:58:54,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:54,582 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2023-11-19 07:58:54,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:54,582 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2023-11-19 07:58:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:58:54,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:54,584 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:54,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:58:54,584 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:54,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1727388030, now seen corresponding path program 1 times [2023-11-19 07:58:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:54,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939447602] [2023-11-19 07:58:54,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:54,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:55,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:55,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939447602] [2023-11-19 07:58:55,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939447602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:55,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:55,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 07:58:55,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715181447] [2023-11-19 07:58:55,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:55,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:58:55,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:55,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:58:55,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:58:55,100 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:55,526 INFO L93 Difference]: Finished difference Result 303 states and 429 transitions. [2023-11-19 07:58:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:58:55,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-19 07:58:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:55,531 INFO L225 Difference]: With dead ends: 303 [2023-11-19 07:58:55,531 INFO L226 Difference]: Without dead ends: 203 [2023-11-19 07:58:55,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-19 07:58:55,533 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 170 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:55,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 573 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:58:55,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-19 07:58:55,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 113. [2023-11-19 07:58:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 95 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 160 transitions. [2023-11-19 07:58:55,548 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 160 transitions. Word has length 118 [2023-11-19 07:58:55,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:55,549 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 160 transitions. [2023-11-19 07:58:55,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 160 transitions. [2023-11-19 07:58:55,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:58:55,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:55,551 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:55,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:58:55,551 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:55,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash 47619332, now seen corresponding path program 1 times [2023-11-19 07:58:55,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:55,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500815307] [2023-11-19 07:58:55,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:55,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:55,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500815307] [2023-11-19 07:58:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500815307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:55,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:55,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:58:55,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858416784] [2023-11-19 07:58:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:55,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:58:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:55,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:58:55,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:55,690 INFO L87 Difference]: Start difference. First operand 113 states and 160 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:55,731 INFO L93 Difference]: Finished difference Result 286 states and 401 transitions. [2023-11-19 07:58:55,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:58:55,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-19 07:58:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:55,735 INFO L225 Difference]: With dead ends: 286 [2023-11-19 07:58:55,735 INFO L226 Difference]: Without dead ends: 176 [2023-11-19 07:58:55,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:55,738 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 75 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:55,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 244 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:58:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-11-19 07:58:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 123. [2023-11-19 07:58:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 105 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2023-11-19 07:58:55,753 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 118 [2023-11-19 07:58:55,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:55,754 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2023-11-19 07:58:55,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2023-11-19 07:58:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:58:55,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:55,756 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:55,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:58:55,757 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:55,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:55,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1980773252, now seen corresponding path program 1 times [2023-11-19 07:58:55,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:55,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369441322] [2023-11-19 07:58:55,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:55,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:55,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:55,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369441322] [2023-11-19 07:58:55,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369441322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:55,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:55,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:58:55,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548092592] [2023-11-19 07:58:55,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:55,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:58:55,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:55,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:58:55,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:55,887 INFO L87 Difference]: Start difference. First operand 123 states and 170 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:55,929 INFO L93 Difference]: Finished difference Result 322 states and 446 transitions. [2023-11-19 07:58:55,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:58:55,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-19 07:58:55,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:55,933 INFO L225 Difference]: With dead ends: 322 [2023-11-19 07:58:55,934 INFO L226 Difference]: Without dead ends: 202 [2023-11-19 07:58:55,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:55,935 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 79 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:55,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 187 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:58:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-19 07:58:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 141. [2023-11-19 07:58:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.3170731707317074) internal successors, (162), 123 states have internal predecessors, (162), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 194 transitions. [2023-11-19 07:58:55,945 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 194 transitions. Word has length 118 [2023-11-19 07:58:55,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:55,946 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 194 transitions. [2023-11-19 07:58:55,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 194 transitions. [2023-11-19 07:58:55,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:58:55,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:55,948 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:55,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:58:55,949 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:55,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:55,949 INFO L85 PathProgramCache]: Analyzing trace with hash -539186682, now seen corresponding path program 1 times [2023-11-19 07:58:55,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:55,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651205326] [2023-11-19 07:58:55,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:55,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,273 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:56,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:56,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651205326] [2023-11-19 07:58:56,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651205326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:56,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:56,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:58:56,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196711458] [2023-11-19 07:58:56,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:56,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:58:56,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:56,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:58:56,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:58:56,276 INFO L87 Difference]: Start difference. First operand 141 states and 194 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:56,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:56,427 INFO L93 Difference]: Finished difference Result 332 states and 459 transitions. [2023-11-19 07:58:56,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:58:56,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-19 07:58:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:56,430 INFO L225 Difference]: With dead ends: 332 [2023-11-19 07:58:56,430 INFO L226 Difference]: Without dead ends: 194 [2023-11-19 07:58:56,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:58:56,431 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 171 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:56,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 182 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:58:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-11-19 07:58:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 141. [2023-11-19 07:58:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.3008130081300813) internal successors, (160), 123 states have internal predecessors, (160), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 192 transitions. [2023-11-19 07:58:56,448 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 192 transitions. Word has length 118 [2023-11-19 07:58:56,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:56,449 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 192 transitions. [2023-11-19 07:58:56,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 192 transitions. [2023-11-19 07:58:56,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:58:56,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:56,451 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:56,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:58:56,451 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:56,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:56,452 INFO L85 PathProgramCache]: Analyzing trace with hash 288538153, now seen corresponding path program 1 times [2023-11-19 07:58:56,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:56,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107001862] [2023-11-19 07:58:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:56,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:56,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:56,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107001862] [2023-11-19 07:58:56,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107001862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:56,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:56,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:58:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115692043] [2023-11-19 07:58:56,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:56,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:58:56,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:56,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:58:56,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:56,608 INFO L87 Difference]: Start difference. First operand 141 states and 192 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:56,677 INFO L93 Difference]: Finished difference Result 323 states and 441 transitions. [2023-11-19 07:58:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:58:56,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-19 07:58:56,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:56,679 INFO L225 Difference]: With dead ends: 323 [2023-11-19 07:58:56,680 INFO L226 Difference]: Without dead ends: 185 [2023-11-19 07:58:56,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:56,681 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:56,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 223 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:58:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-11-19 07:58:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 121. [2023-11-19 07:58:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.2815533980582525) internal successors, (132), 103 states have internal predecessors, (132), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 164 transitions. [2023-11-19 07:58:56,708 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 164 transitions. Word has length 118 [2023-11-19 07:58:56,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:56,709 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 164 transitions. [2023-11-19 07:58:56,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 164 transitions. [2023-11-19 07:58:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:58:56,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:56,711 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:56,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:58:56,711 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:56,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:56,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1197972584, now seen corresponding path program 1 times [2023-11-19 07:58:56,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:56,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773726863] [2023-11-19 07:58:56,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:56,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:56,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:56,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773726863] [2023-11-19 07:58:56,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773726863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:56,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:56,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:58:56,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643170543] [2023-11-19 07:58:56,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:56,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:58:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:56,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:58:56,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:56,862 INFO L87 Difference]: Start difference. First operand 121 states and 164 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:56,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:56,953 INFO L93 Difference]: Finished difference Result 312 states and 421 transitions. [2023-11-19 07:58:56,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:58:56,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-19 07:58:56,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:56,955 INFO L225 Difference]: With dead ends: 312 [2023-11-19 07:58:56,955 INFO L226 Difference]: Without dead ends: 194 [2023-11-19 07:58:56,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:56,957 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 81 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:56,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 171 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:58:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-11-19 07:58:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2023-11-19 07:58:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.265625) internal successors, (162), 128 states have internal predecessors, (162), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:58:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 194 transitions. [2023-11-19 07:58:56,989 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 194 transitions. Word has length 118 [2023-11-19 07:58:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:56,990 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 194 transitions. [2023-11-19 07:58:56,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 194 transitions. [2023-11-19 07:58:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:58:56,992 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:56,992 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:56,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:58:56,993 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:56,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1140714282, now seen corresponding path program 1 times [2023-11-19 07:58:56,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:56,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885443334] [2023-11-19 07:58:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:56,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:58:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:58:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:58:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:58:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:58:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 07:58:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 07:58:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-19 07:58:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-19 07:58:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-19 07:58:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-19 07:58:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-19 07:58:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-19 07:58:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-19 07:58:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-19 07:58:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-19 07:58:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:58:57,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:57,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885443334] [2023-11-19 07:58:57,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885443334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:57,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:57,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:58:57,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370477040] [2023-11-19 07:58:57,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:57,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:58:57,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:57,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:58:57,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:58:57,589 INFO L87 Difference]: Start difference. First operand 146 states and 194 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:58:57,796 INFO L93 Difference]: Finished difference Result 433 states and 577 transitions. [2023-11-19 07:58:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:58:57,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2023-11-19 07:58:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:58:57,799 INFO L225 Difference]: With dead ends: 433 [2023-11-19 07:58:57,800 INFO L226 Difference]: Without dead ends: 290 [2023-11-19 07:58:57,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:58:57,801 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 110 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:58:57,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 316 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:58:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-11-19 07:58:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 180. [2023-11-19 07:58:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 145 states have internal predecessors, (179), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-19 07:58:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 243 transitions. [2023-11-19 07:58:57,859 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 243 transitions. Word has length 118 [2023-11-19 07:58:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:58:57,860 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 243 transitions. [2023-11-19 07:58:57,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:58:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 243 transitions. [2023-11-19 07:58:57,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-19 07:58:57,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:58:57,862 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:57,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:58:57,862 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:58:57,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:57,864 INFO L85 PathProgramCache]: Analyzing trace with hash -921859564, now seen corresponding path program 1 times [2023-11-19 07:58:57,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:57,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051820290] [2023-11-19 07:58:57,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:57,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:58:57,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:58:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:58:58,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:58:58,052 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:58:58,053 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:58:58,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:58:58,059 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:58,063 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:58:58,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-19 07:58:58,172 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-19 07:58:58,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-19 07:58:58,175 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-19 07:58:58,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-19 07:58:58,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-19 07:58:58,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-19 07:58:58,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-19 07:58:58,177 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-19 07:58:58,177 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-19 07:58:58,177 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated [2023-11-19 07:58:58,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:58:58 BoogieIcfgContainer [2023-11-19 07:58:58,210 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:58:58,211 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:58:58,211 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:58:58,211 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:58:58,212 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:48" (3/4) ... [2023-11-19 07:58:58,214 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:58:58,215 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:58:58,216 INFO L158 Benchmark]: Toolchain (without parser) took 10778.23ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 125.6MB in the beginning and 72.7MB in the end (delta: 52.8MB). Peak memory consumption was 124.2MB. Max. memory is 16.1GB. [2023-11-19 07:58:58,216 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 127.9MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:58:58,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.75ms. Allocated memory is still 155.2MB. Free memory was 125.1MB in the beginning and 111.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:58:58,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.60ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 107.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:58:58,218 INFO L158 Benchmark]: Boogie Preprocessor took 44.85ms. Allocated memory is still 155.2MB. Free memory was 107.4MB in the beginning and 105.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:58:58,219 INFO L158 Benchmark]: RCFGBuilder took 682.42ms. Allocated memory is still 155.2MB. Free memory was 105.3MB in the beginning and 83.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-19 07:58:58,219 INFO L158 Benchmark]: TraceAbstraction took 9595.25ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 82.8MB in the beginning and 73.8MB in the end (delta: 9.0MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2023-11-19 07:58:58,220 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 224.4MB. Free memory was 73.8MB in the beginning and 72.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:58:58,222 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 127.9MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.75ms. Allocated memory is still 155.2MB. Free memory was 125.1MB in the beginning and 111.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.60ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 107.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.85ms. Allocated memory is still 155.2MB. Free memory was 107.4MB in the beginning and 105.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 682.42ms. Allocated memory is still 155.2MB. Free memory was 105.3MB in the beginning and 83.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9595.25ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 82.8MB in the beginning and 73.8MB in the end (delta: 9.0MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 224.4MB. Free memory was 73.8MB in the beginning and 72.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet18 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of shiftRight at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L128] isInitial = 1 [L129] FCALL initially() [L130] int k_loop; [L131] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L131] COND TRUE k_loop < 1 [L132] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L133] RET updateVariables() [L134] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=16, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=64, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=10, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L134] RET step() [L135] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=507, var_1_18=509, var_1_19=510, var_1_1=66, var_1_20=508, var_1_21=506, var_1_22=507, var_1_23=505, var_1_24=0, var_1_26=-1, var_1_27=62, var_1_28=-63, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 15, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1299 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1299 mSDsluCounter, 4300 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2522 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1223 IncrementalHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 1778 mSDtfsCounter, 1223 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 497 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=14, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 821 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1760 NumberOfCodeBlocks, 1760 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1628 ConstructedInterpolants, 0 QuantifiedInterpolants, 3851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6720/6720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 07:58:58,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:59:01,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:59:01,156 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-19 07:59:01,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:59:01,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:59:01,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:59:01,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:59:01,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:59:01,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:59:01,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:59:01,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:59:01,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:59:01,220 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:59:01,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:59:01,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:59:01,223 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:59:01,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:59:01,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:59:01,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:59:01,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:59:01,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:59:01,226 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:59:01,227 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:59:01,227 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:59:01,228 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:59:01,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:59:01,228 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:59:01,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:59:01,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:59:01,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:59:01,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:59:01,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:59:01,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:59:01,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:59:01,233 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:59:01,233 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:59:01,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:59:01,233 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:59:01,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:59:01,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:59:01,235 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:59:01,235 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:59:01,236 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad [2023-11-19 07:59:01,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:59:01,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:59:01,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:59:01,711 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:59:01,712 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:59:01,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-11-19 07:59:04,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:59:05,149 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:59:05,150 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-11-19 07:59:05,163 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/data/e4b11dedb/16439d9c34e14af1b042788b2ee0b147/FLAG1f8b11b1e [2023-11-19 07:59:05,178 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/data/e4b11dedb/16439d9c34e14af1b042788b2ee0b147 [2023-11-19 07:59:05,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:59:05,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:59:05,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:59:05,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:59:05,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:59:05,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:59:05" (1/1) ... [2023-11-19 07:59:05,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c4e19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05, skipping insertion in model container [2023-11-19 07:59:05,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:59:05" (1/1) ... [2023-11-19 07:59:05,222 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:59:05,385 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2023-11-19 07:59:05,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:59:05,509 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:59:05,527 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2023-11-19 07:59:05,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:59:05,625 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:59:05,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05 WrapperNode [2023-11-19 07:59:05,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:59:05,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:59:05,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:59:05,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:59:05,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05" (1/1) ... [2023-11-19 07:59:05,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05" (1/1) ... [2023-11-19 07:59:05,703 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2023-11-19 07:59:05,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:59:05,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:59:05,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:59:05,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:59:05,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05" (1/1) ... [2023-11-19 07:59:05,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05" (1/1) ... [2023-11-19 07:59:05,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05" (1/1) ... [2023-11-19 07:59:05,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05" (1/1) ... [2023-11-19 07:59:05,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05" (1/1) ... [2023-11-19 07:59:05,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05" (1/1) ... [2023-11-19 07:59:05,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05" (1/1) ... [2023-11-19 07:59:05,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05" (1/1) ... [2023-11-19 07:59:05,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:59:05,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:59:05,788 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:59:05,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:59:05,789 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05" (1/1) ... [2023-11-19 07:59:05,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:59:05,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:59:05,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:59:05,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:59:05,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:59:05,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:59:05,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:59:05,881 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:59:05,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:59:05,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:59:06,015 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:59:06,018 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:59:10,655 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:59:10,679 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:59:10,680 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:59:10,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:10 BoogieIcfgContainer [2023-11-19 07:59:10,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:59:10,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:59:10,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:59:10,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:59:10,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:59:05" (1/3) ... [2023-11-19 07:59:10,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511d704e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:59:10, skipping insertion in model container [2023-11-19 07:59:10,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:59:05" (2/3) ... [2023-11-19 07:59:10,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511d704e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:59:10, skipping insertion in model container [2023-11-19 07:59:10,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:59:10" (3/3) ... [2023-11-19 07:59:10,696 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i [2023-11-19 07:59:10,717 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:59:10,717 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:59:10,772 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:59:10,779 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@450b9dcf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:59:10,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:59:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:59:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-19 07:59:10,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:10,806 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:10,806 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:10,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash -94440497, now seen corresponding path program 1 times [2023-11-19 07:59:10,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:59:10,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311769593] [2023-11-19 07:59:10,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:10,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:59:10,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:59:10,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:59:10,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-19 07:59:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:11,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 07:59:11,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2023-11-19 07:59:11,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:59:11,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:59:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311769593] [2023-11-19 07:59:11,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311769593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:11,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:11,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:59:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461214040] [2023-11-19 07:59:11,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:11,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:59:11,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:59:11,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:59:11,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:59:11,641 INFO L87 Difference]: Start difference. First operand has 59 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:59:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:11,712 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2023-11-19 07:59:11,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:59:11,715 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2023-11-19 07:59:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:11,726 INFO L225 Difference]: With dead ends: 115 [2023-11-19 07:59:11,726 INFO L226 Difference]: Without dead ends: 55 [2023-11-19 07:59:11,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:59:11,736 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:11,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:59:11,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-19 07:59:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-19 07:59:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-19 07:59:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2023-11-19 07:59:11,786 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 110 [2023-11-19 07:59:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:11,787 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2023-11-19 07:59:11,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-19 07:59:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2023-11-19 07:59:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-19 07:59:11,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:11,792 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:11,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:59:11,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:59:11,996 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:11,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:11,997 INFO L85 PathProgramCache]: Analyzing trace with hash 530981763, now seen corresponding path program 1 times [2023-11-19 07:59:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:59:11,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424108611] [2023-11-19 07:59:11,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:11,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:59:11,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:59:12,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:59:12,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-19 07:59:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:12,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 07:59:12,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:59:14,176 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:59:14,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:59:14,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424108611] [2023-11-19 07:59:14,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424108611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:14,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:14,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:59:14,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805474171] [2023-11-19 07:59:14,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:14,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:59:14,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:59:14,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:59:14,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:59:14,181 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:59:16,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:59:18,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:59:20,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:59:22,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:59:24,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:59:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:24,211 INFO L93 Difference]: Finished difference Result 160 states and 232 transitions. [2023-11-19 07:59:24,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:59:24,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2023-11-19 07:59:24,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:24,240 INFO L225 Difference]: With dead ends: 160 [2023-11-19 07:59:24,240 INFO L226 Difference]: Without dead ends: 108 [2023-11-19 07:59:24,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:59:24,243 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 78 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 33 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:24,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 251 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 56 Invalid, 4 Unknown, 0 Unchecked, 9.9s Time] [2023-11-19 07:59:24,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-19 07:59:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2023-11-19 07:59:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-19 07:59:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2023-11-19 07:59:24,283 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 110 [2023-11-19 07:59:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:24,285 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2023-11-19 07:59:24,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:59:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2023-11-19 07:59:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-19 07:59:24,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:24,288 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:24,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:59:24,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:59:24,504 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:24,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash -480135487, now seen corresponding path program 1 times [2023-11-19 07:59:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:59:24,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123067564] [2023-11-19 07:59:24,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:24,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:59:24,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:59:24,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:59:24,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-19 07:59:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:24,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 07:59:24,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:59:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-19 07:59:25,074 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:59:25,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:59:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123067564] [2023-11-19 07:59:25,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123067564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:59:25,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:59:25,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:59:25,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256158451] [2023-11-19 07:59:25,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:59:25,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:59:25,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:59:25,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:59:25,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:59:25,078 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:59:27,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:59:29,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-19 07:59:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:59:29,364 INFO L93 Difference]: Finished difference Result 158 states and 227 transitions. [2023-11-19 07:59:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:59:29,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2023-11-19 07:59:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:59:29,369 INFO L225 Difference]: With dead ends: 158 [2023-11-19 07:59:29,369 INFO L226 Difference]: Without dead ends: 106 [2023-11-19 07:59:29,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:59:29,372 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 15 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:59:29,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2023-11-19 07:59:29,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-19 07:59:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2023-11-19 07:59:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-19 07:59:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2023-11-19 07:59:29,394 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 110 [2023-11-19 07:59:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:59:29,395 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2023-11-19 07:59:29,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-19 07:59:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2023-11-19 07:59:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-19 07:59:29,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:59:29,398 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:59:29,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:59:29,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:59:29,614 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:59:29,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:59:29,615 INFO L85 PathProgramCache]: Analyzing trace with hash 479094529, now seen corresponding path program 1 times [2023-11-19 07:59:29,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:59:29,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328613587] [2023-11-19 07:59:29,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:59:29,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 07:59:29,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:59:29,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 07:59:29,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71904d3c-788e-4ceb-9c0c-e7dcd1c81f0f/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-19 07:59:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:59:30,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-19 07:59:30,056 INFO L285 TraceCheckSpWp]: Computing forward predicates...