./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 04:50:24,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 04:50:24,734 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 04:50:24,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 04:50:24,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 04:50:24,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 04:50:24,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 04:50:24,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 04:50:24,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 04:50:24,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 04:50:24,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 04:50:24,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 04:50:24,760 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 04:50:24,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 04:50:24,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 04:50:24,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 04:50:24,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 04:50:24,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 04:50:24,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 04:50:24,760 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 04:50:24,760 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 04:50:24,760 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 04:50:24,760 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 04:50:24,760 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 04:50:24,760 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 04:50:24,761 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 04:50:24,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 04:50:24,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:50:24,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 04:50:24,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 04:50:24,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 04:50:24,761 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 04:50:24,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 04:50:24,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b 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 -> Kojak 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 -> 8b0406e617bfcdc7e6543e19b38e9be8eeb37f2896cb91bcfe6035d747328da7 [2024-12-06 04:50:24,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 04:50:24,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 04:50:24,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 04:50:24,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 04:50:24,971 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 04:50:24,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-12-06 04:50:27,626 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/data/857a42592/12b719efce9d41ffb3b3b7a57d1f9749/FLAGa31f4fad8 [2024-12-06 04:50:27,883 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 04:50:27,883 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-12-06 04:50:27,894 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/data/857a42592/12b719efce9d41ffb3b3b7a57d1f9749/FLAGa31f4fad8 [2024-12-06 04:50:28,219 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/data/857a42592/12b719efce9d41ffb3b3b7a57d1f9749 [2024-12-06 04:50:28,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 04:50:28,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 04:50:28,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 04:50:28,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 04:50:28,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 04:50:28,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6431aeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28, skipping insertion in model container [2024-12-06 04:50:28,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 04:50:28,451 WARN L250 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_d8766cf0-380f-4b7f-b39a-b0acad01bd69/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2024-12-06 04:50:28,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:50:28,465 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 04:50:28,513 WARN L250 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_d8766cf0-380f-4b7f-b39a-b0acad01bd69/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.BOUNDED-6.pals.c[11348,11361] [2024-12-06 04:50:28,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:50:28,529 INFO L204 MainTranslator]: Completed translation [2024-12-06 04:50:28,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28 WrapperNode [2024-12-06 04:50:28,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 04:50:28,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 04:50:28,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 04:50:28,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 04:50:28,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,573 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2024-12-06 04:50:28,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 04:50:28,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 04:50:28,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 04:50:28,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 04:50:28,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,592 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 04:50:28,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 04:50:28,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 04:50:28,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 04:50:28,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:50:28" (1/1) ... [2024-12-06 04:50:28,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:50:28,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 04:50:28,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 04:50:28,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 04:50:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 04:50:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 04:50:28,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 04:50:28,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 04:50:28,752 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 04:50:28,754 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 04:50:29,258 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-12-06 04:50:29,258 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 04:50:29,745 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 04:50:29,746 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 04:50:29,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:50:29 BoogieIcfgContainer [2024-12-06 04:50:29,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 04:50:29,747 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 04:50:29,747 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 04:50:29,753 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 04:50:29,754 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:50:29" (1/1) ... [2024-12-06 04:50:29,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 04:50:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-12-06 04:50:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-12-06 04:50:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 04:50:29,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2024-12-06 04:50:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2024-12-06 04:50:31,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 04:50:31,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:31,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2024-12-06 04:50:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2024-12-06 04:50:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 04:50:32,352 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:32,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:33,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2024-12-06 04:50:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2024-12-06 04:50:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 04:50:33,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:33,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2024-12-06 04:50:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2024-12-06 04:50:34,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 04:50:34,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2024-12-06 04:50:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2024-12-06 04:50:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:50:36,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:36,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2024-12-06 04:50:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2024-12-06 04:50:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:50:37,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:37,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:37,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2024-12-06 04:50:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2024-12-06 04:50:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:50:37,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:37,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:37,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2024-12-06 04:50:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2024-12-06 04:50:37,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:50:37,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:37,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 58 states and 105 transitions. [2024-12-06 04:50:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2024-12-06 04:50:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 04:50:39,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:39,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 61 states and 111 transitions. [2024-12-06 04:50:40,202 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 111 transitions. [2024-12-06 04:50:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 04:50:40,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:40,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 77 states and 147 transitions. [2024-12-06 04:50:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 147 transitions. [2024-12-06 04:50:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:50:45,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 94 states and 184 transitions. [2024-12-06 04:50:49,848 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 184 transitions. [2024-12-06 04:50:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:50:49,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 95 states and 187 transitions. [2024-12-06 04:50:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 187 transitions. [2024-12-06 04:50:50,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:50:50,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:50,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 109 states and 218 transitions. [2024-12-06 04:50:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 218 transitions. [2024-12-06 04:50:55,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:50:55,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 110 states and 221 transitions. [2024-12-06 04:50:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 221 transitions. [2024-12-06 04:50:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:50:55,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:55,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 111 states and 222 transitions. [2024-12-06 04:50:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 222 transitions. [2024-12-06 04:50:56,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:50:56,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:50:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:50:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 112 states and 226 transitions. [2024-12-06 04:50:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 226 transitions. [2024-12-06 04:50:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:50:57,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:50:57,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:50:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:50:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:51:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:51:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 126 states and 254 transitions. [2024-12-06 04:51:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 254 transitions. [2024-12-06 04:51:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:51:03,209 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:51:03,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:51:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:51:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:51:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:51:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 132 states and 272 transitions. [2024-12-06 04:51:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 272 transitions. [2024-12-06 04:51:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:51:06,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:51:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:51:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:51:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:51:07,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:51:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 133 states and 273 transitions. [2024-12-06 04:51:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 273 transitions. [2024-12-06 04:51:07,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:51:07,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:51:07,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:51:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:51:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:51:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:51:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 152 states and 309 transitions. [2024-12-06 04:51:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 309 transitions. [2024-12-06 04:51:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:51:14,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:51:14,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:51:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:51:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:51:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:51:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 157 states and 322 transitions. [2024-12-06 04:51:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 322 transitions. [2024-12-06 04:51:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:51:18,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:51:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:51:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:51:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:51:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:51:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 160 states and 327 transitions. [2024-12-06 04:51:20,494 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 327 transitions. [2024-12-06 04:51:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:51:20,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:51:20,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:51:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:51:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:51:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:51:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 175 states and 351 transitions. [2024-12-06 04:51:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 351 transitions. [2024-12-06 04:51:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:51:26,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:51:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:51:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:51:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:51:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:51:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 176 states and 353 transitions. [2024-12-06 04:51:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 353 transitions. [2024-12-06 04:51:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 04:51:28,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:51:28,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:51:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:51:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:51:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:51:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 196 states and 392 transitions. [2024-12-06 04:51:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 392 transitions. [2024-12-06 04:51:34,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 04:51:34,645 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:51:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:51:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:51:36,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:51:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:51:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 208 states and 418 transitions. [2024-12-06 04:51:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 418 transitions. [2024-12-06 04:51:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 04:51:43,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:51:43,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:51:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:51:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:51:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:51:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 208 states and 417 transitions. [2024-12-06 04:51:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 417 transitions. [2024-12-06 04:51:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 04:51:43,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:51:43,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:51:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:51:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:51:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:51:55,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 236 states and 487 transitions. [2024-12-06 04:51:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 487 transitions. [2024-12-06 04:51:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 04:51:55,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:51:55,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:51:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:51:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:52:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:52:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 250 states and 543 transitions. [2024-12-06 04:52:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 543 transitions. [2024-12-06 04:52:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 04:52:06,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:52:06,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:52:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:52:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:52:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:52:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 278 states and 617 transitions. [2024-12-06 04:52:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 617 transitions. [2024-12-06 04:52:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 04:52:23,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:52:23,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:52:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:52:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:52:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:52:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 289 states and 640 transitions. [2024-12-06 04:52:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 640 transitions. [2024-12-06 04:52:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 04:52:31,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:52:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:52:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:52:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:52:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:52:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 298 states and 671 transitions. [2024-12-06 04:52:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 671 transitions. [2024-12-06 04:52:39,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 04:52:39,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:52:39,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:52:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:52:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:52:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:52:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 310 states and 698 transitions. [2024-12-06 04:52:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 698 transitions. [2024-12-06 04:52:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 04:52:51,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:52:51,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:52:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:52:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:52:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:52:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 311 states and 706 transitions. [2024-12-06 04:52:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 706 transitions. [2024-12-06 04:52:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 04:52:53,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:52:53,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:52:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:52:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:52:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:52:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 316 states and 733 transitions. [2024-12-06 04:52:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 733 transitions. [2024-12-06 04:52:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:52:58,486 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:52:58,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:52:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:53:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:53:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:53:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 326 states and 768 transitions. [2024-12-06 04:53:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 768 transitions. [2024-12-06 04:53:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:53:08,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:53:08,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:53:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:53:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:53:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:53:13,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 334 states and 785 transitions. [2024-12-06 04:53:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 785 transitions. [2024-12-06 04:53:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:53:13,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:53:13,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:53:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:53:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:53:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:53:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 338 states and 791 transitions. [2024-12-06 04:53:16,201 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 791 transitions. [2024-12-06 04:53:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:53:16,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:53:16,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:53:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:53:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:53:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:53:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 339 states and 798 transitions. [2024-12-06 04:53:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 798 transitions. [2024-12-06 04:53:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:53:18,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:53:18,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:53:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:53:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:53:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:53:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 353 states and 835 transitions. [2024-12-06 04:53:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 835 transitions. [2024-12-06 04:53:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:53:29,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:53:29,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:53:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:53:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:53:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:53:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 354 states and 836 transitions. [2024-12-06 04:53:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 836 transitions. [2024-12-06 04:53:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:53:31,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:53:31,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:53:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:53:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:53:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:53:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 358 states and 848 transitions. [2024-12-06 04:53:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 848 transitions. [2024-12-06 04:53:35,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:53:35,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:53:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:53:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:53:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:53:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:53:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 368 states and 886 transitions. [2024-12-06 04:53:47,772 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 886 transitions. [2024-12-06 04:53:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:53:47,772 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:53:47,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:53:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:53:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:53:54,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:53:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 376 states and 907 transitions. [2024-12-06 04:53:54,922 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 907 transitions. [2024-12-06 04:53:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:53:54,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:53:54,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:53:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:53:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:54:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:54:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 390 states and 942 transitions. [2024-12-06 04:54:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 942 transitions. [2024-12-06 04:54:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:54:11,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:54:11,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:54:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:54:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:54:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:54:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 391 states and 949 transitions. [2024-12-06 04:54:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 949 transitions. [2024-12-06 04:54:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:54:14,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:54:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:54:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:54:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:54:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:54:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 397 states and 977 transitions. [2024-12-06 04:54:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 977 transitions. [2024-12-06 04:54:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:54:28,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:54:28,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:54:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:54:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:54:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:54:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 401 states and 986 transitions. [2024-12-06 04:54:33,872 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 986 transitions. [2024-12-06 04:54:33,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:54:33,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:54:33,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:54:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:54:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:54:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:54:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 415 states and 1024 transitions. [2024-12-06 04:54:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1024 transitions. [2024-12-06 04:54:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:54:52,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:54:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:54:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:54:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:54:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:54:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 416 states and 1031 transitions. [2024-12-06 04:54:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1031 transitions. [2024-12-06 04:54:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:54:54,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:54:54,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:54:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:54:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:55:06,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:55:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 422 states and 1063 transitions. [2024-12-06 04:55:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1063 transitions. [2024-12-06 04:55:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:55:06,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:55:06,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:55:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:55:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:55:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:55:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 427 states and 1083 transitions. [2024-12-06 04:55:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1083 transitions. [2024-12-06 04:55:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:55:17,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:55:17,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:55:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:55:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:55:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:55:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 428 states and 1089 transitions. [2024-12-06 04:55:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1089 transitions. [2024-12-06 04:55:20,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:55:20,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:55:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:55:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:55:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:55:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:55:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 434 states and 1112 transitions. [2024-12-06 04:55:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1112 transitions. [2024-12-06 04:55:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:55:28,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:55:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:55:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:55:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:55:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:55:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 438 states and 1125 transitions. [2024-12-06 04:55:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1125 transitions. [2024-12-06 04:55:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:55:35,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:55:35,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:55:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:55:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:55:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:55:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 440 states and 1143 transitions. [2024-12-06 04:55:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1143 transitions. [2024-12-06 04:55:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:55:38,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:55:38,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:55:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:55:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:55:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:55:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 441 states and 1149 transitions. [2024-12-06 04:55:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1149 transitions. [2024-12-06 04:55:41,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:55:41,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:55:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:55:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:55:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:55:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:55:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 442 states and 1156 transitions. [2024-12-06 04:55:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1156 transitions. [2024-12-06 04:55:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:55:43,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:55:43,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:55:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:55:45,157 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:55:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:55:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 446 states and 1173 transitions. [2024-12-06 04:55:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1173 transitions. [2024-12-06 04:55:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:55:49,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:55:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:55:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:55:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:55:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:55:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 453 states and 1203 transitions. [2024-12-06 04:55:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1203 transitions. [2024-12-06 04:55:59,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:55:59,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:55:59,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:55:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 461 states and 1233 transitions. [2024-12-06 04:56:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1233 transitions. [2024-12-06 04:56:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:56:10,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:10,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 462 states and 1237 transitions. [2024-12-06 04:56:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1237 transitions. [2024-12-06 04:56:12,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:56:12,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:12,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:16,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 465 states and 1254 transitions. [2024-12-06 04:56:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1254 transitions. [2024-12-06 04:56:16,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:56:16,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 468 states and 1258 transitions. [2024-12-06 04:56:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1258 transitions. [2024-12-06 04:56:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:56:20,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:22,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 469 states and 1262 transitions. [2024-12-06 04:56:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1262 transitions. [2024-12-06 04:56:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:56:22,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:22,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:37,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 477 states and 1288 transitions. [2024-12-06 04:56:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1288 transitions. [2024-12-06 04:56:37,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:56:37,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:37,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 479 states and 1294 transitions. [2024-12-06 04:56:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1294 transitions. [2024-12-06 04:56:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:56:42,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:42,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 484 states and 1319 transitions. [2024-12-06 04:56:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1319 transitions. [2024-12-06 04:56:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:56:50,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:50,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 487 states and 1339 transitions. [2024-12-06 04:56:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1339 transitions. [2024-12-06 04:56:55,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:56:55,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:55,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:56:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:56:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 488 states and 1340 transitions. [2024-12-06 04:56:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1340 transitions. [2024-12-06 04:56:57,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:56:57,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:56:57,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:56:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:56:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:57:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 489 states and 1345 transitions. [2024-12-06 04:57:00,178 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1345 transitions. [2024-12-06 04:57:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:57:00,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:57:00,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:57:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:57:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:57:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 491 states and 1348 transitions. [2024-12-06 04:57:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 1348 transitions. [2024-12-06 04:57:05,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:57:05,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:57:05,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:57:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:57:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:57:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 493 states and 1354 transitions. [2024-12-06 04:57:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1354 transitions. [2024-12-06 04:57:12,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:57:12,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:57:12,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:57:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:57:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:57:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 494 states and 1358 transitions. [2024-12-06 04:57:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1358 transitions. [2024-12-06 04:57:14,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:57:14,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:57:14,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:57:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:57:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:57:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 497 states and 1375 transitions. [2024-12-06 04:57:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1375 transitions. [2024-12-06 04:57:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:57:19,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:57:19,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:57:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:57:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:57:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:57:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 498 states and 1379 transitions. [2024-12-06 04:57:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1379 transitions. [2024-12-06 04:57:21,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 04:57:21,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:57:21,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:57:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:57:22,266 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 04:57:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:57:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:57:23,195 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 04:57:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:57:23,537 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 78 iterations. [2024-12-06 04:57:23,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 04:57:23 ImpRootNode [2024-12-06 04:57:23,688 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 04:57:23,692 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 04:57:23,692 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 04:57:23,695 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 04:57:23,701 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:50:29" (3/4) ... [2024-12-06 04:57:23,702 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 04:57:23,862 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 166. [2024-12-06 04:57:23,987 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 04:57:23,987 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 04:57:23,987 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 04:57:23,988 INFO L158 Benchmark]: Toolchain (without parser) took 415766.55ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 93.2MB in the beginning and 930.2MB in the end (delta: -837.0MB). Peak memory consumption was 467.1MB. Max. memory is 16.1GB. [2024-12-06 04:57:23,989 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 72.5MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:57:23,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.39ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 76.6MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 04:57:23,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.39ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 73.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:57:23,989 INFO L158 Benchmark]: Boogie Preprocessor took 32.60ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 04:57:23,990 INFO L158 Benchmark]: RCFGBuilder took 1139.29ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 42.0MB in the end (delta: 29.6MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2024-12-06 04:57:23,990 INFO L158 Benchmark]: CodeCheck took 413941.25ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 42.0MB in the beginning and 955.4MB in the end (delta: -913.3MB). Peak memory consumption was 392.2MB. Max. memory is 16.1GB. [2024-12-06 04:57:23,990 INFO L158 Benchmark]: Witness Printer took 295.49ms. Allocated memory is still 1.4GB. Free memory was 955.4MB in the beginning and 930.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 04:57:23,992 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 413.8s, OverallIterations: 78, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51374 SdHoareTripleChecker+Valid, 289.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48797 mSDsluCounter, 25722 SdHoareTripleChecker+Invalid, 258.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24451 mSDsCounter, 17382 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 151932 IncrementalHoareTripleChecker+Invalid, 169314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17382 mSolverCounterUnsat, 1271 mSDtfsCounter, 151932 mSolverCounterSat, 1.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30386 GetRequests, 27575 SyntacticMatches, 1153 SemanticMatches, 1658 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638697 ImplicationChecksByTransitivity, 335.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 89.7s InterpolantComputationTime, 2463 NumberOfCodeBlocks, 2463 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 2338 ConstructedInterpolants, 0 QuantifiedInterpolants, 20463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 77 InterpolantComputations, 11 PerfectInterpolantSequences, 297/1628 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 531]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L452] int c1 ; [L453] int i2 ; [L456] c1 = 0 [L457] ep12 = __VERIFIER_nondet_bool() [L458] ep13 = __VERIFIER_nondet_bool() [L459] ep21 = __VERIFIER_nondet_bool() [L460] ep23 = __VERIFIER_nondet_bool() [L461] ep31 = __VERIFIER_nondet_bool() [L462] ep32 = __VERIFIER_nondet_bool() [L463] id1 = __VERIFIER_nondet_char() [L464] r1 = __VERIFIER_nondet_char() [L465] st1 = __VERIFIER_nondet_char() [L466] nl1 = __VERIFIER_nondet_char() [L467] m1 = __VERIFIER_nondet_char() [L468] max1 = __VERIFIER_nondet_char() [L469] mode1 = __VERIFIER_nondet_bool() [L470] id2 = __VERIFIER_nondet_char() [L471] r2 = __VERIFIER_nondet_char() [L472] st2 = __VERIFIER_nondet_char() [L473] nl2 = __VERIFIER_nondet_char() [L474] m2 = __VERIFIER_nondet_char() [L475] max2 = __VERIFIER_nondet_char() [L476] mode2 = __VERIFIER_nondet_bool() [L477] id3 = __VERIFIER_nondet_char() [L478] r3 = __VERIFIER_nondet_char() [L479] st3 = __VERIFIER_nondet_char() [L480] nl3 = __VERIFIER_nondet_char() [L481] m3 = __VERIFIER_nondet_char() [L482] max3 = __VERIFIER_nondet_char() [L483] mode3 = __VERIFIER_nondet_bool() [L484] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND FALSE !(\read(r121)) [L231] COND FALSE !(\read(r131)) [L238] tmp = 0 [L240] r122 = (_Bool )tmp [L241] COND FALSE !(\read(r131)) [L244] COND FALSE !(\read(r121)) [L251] tmp___0 = 0 [L253] r132 = (_Bool )tmp___0 [L254] COND FALSE !(\read(r211)) [L257] COND FALSE !(\read(r231)) [L264] tmp___1 = 0 [L266] r212 = (_Bool )tmp___1 [L267] COND FALSE !(\read(r231)) [L270] COND FALSE !(\read(r211)) [L277] tmp___2 = 0 [L279] r232 = (_Bool )tmp___2 [L280] COND FALSE !(\read(r311)) [L283] COND FALSE !(\read(r321)) [L290] tmp___3 = 0 [L292] r312 = (_Bool )tmp___3 [L293] COND FALSE !(\read(r321)) [L296] COND FALSE !(\read(r311)) [L303] tmp___4 = 0 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE (int )max1 == (int )id1 [L316] COND TRUE (int )max2 == (int )id2 [L317] COND TRUE (int )max3 == (int )id3 [L318] COND TRUE (int )st1 == 0 [L319] COND TRUE (int )st2 == 0 [L320] COND TRUE (int )st3 == 0 [L321] COND TRUE (int )nl1 == 0 [L322] COND TRUE (int )nl2 == 0 [L323] COND TRUE (int )nl3 == 0 [L324] COND TRUE (int )mode1 == 0 [L325] COND TRUE (int )mode2 == 0 [L326] COND TRUE (int )mode3 == 0 [L327] tmp___5 = 1 [L391] return (tmp___5); [L484] RET, EXPR init() [L484] i2 = init() [L485] COND FALSE !(!(i2)) [L486] p12_old = nomsg [L487] p12_new = nomsg [L488] p13_old = nomsg [L489] p13_new = nomsg [L490] p21_old = nomsg [L491] p21_new = nomsg [L492] p23_old = nomsg [L493] p23_new = nomsg [L494] p31_old = nomsg [L495] p31_new = nomsg [L496] p32_old = nomsg [L497] p32_new = nomsg [L498] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, i2=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L501] RET node1() [L502] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L502] RET node2() [L503] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L408] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] RET assert(c1) [L518] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, i2=1, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND FALSE !(\read(ep31)) [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L501] RET node1() [L502] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND FALSE !(\read(ep32)) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L502] RET node2() [L503] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND FALSE !(\read(ep23)) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L408] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET assert(c1) [L518] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, i2=2, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 2 [L101] COND FALSE !(\read(ep12)) [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L501] RET node1() [L502] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND FALSE !(\read(ep23)) [L151] mode2 = (_Bool)1 [L502] RET node2() [L503] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND FALSE !(\read(ep31)) [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L399] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L400] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L401] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L402] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L403] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L406] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L408] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L418] COND TRUE (int )r1 < 2 [L419] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET assert(c1) [L518] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, i2=3, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L499] COND TRUE i2 < 6 [L501] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND FALSE !(\read(ep31)) [L91] COND TRUE (int )r1 == 2 [L92] COND TRUE (int )max1 == (int )id1 [L93] st1 = (char)1 [L98] mode1 = (_Bool)0 [L501] RET node1() [L502] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND FALSE !(\read(ep12)) [L127] COND FALSE !(\read(ep32)) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L502] RET node2() [L503] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND FALSE !(\read(ep23)) [L177] COND TRUE (int )r3 == 2 [L178] COND TRUE (int )max3 == (int )id3 [L179] st3 = (char)1 [L184] mode3 = (_Bool)0 [L503] RET node3() [L504] p12_old = p12_new [L505] p12_new = nomsg [L506] p13_old = p13_new [L507] p13_new = nomsg [L508] p21_old = p21_new [L509] p21_new = nomsg [L510] p23_old = p23_new [L511] p23_new = nomsg [L512] p31_old = p31_new [L513] p31_new = nomsg [L514] p32_old = p32_new [L515] p32_new = nomsg [L516] CALL, EXPR check() [L396] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L399] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L445] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1, tmp=0] [L447] return (tmp); [L516] RET, EXPR check() [L516] c1 = check() [L517] CALL assert(c1) [L529] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L531] reach_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=126, m2=1, m3=2, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 72.5MB in the end (delta: 86.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.39ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 76.6MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.39ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 73.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.60ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1139.29ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 42.0MB in the end (delta: 29.6MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * CodeCheck took 413941.25ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 42.0MB in the beginning and 955.4MB in the end (delta: -913.3MB). Peak memory consumption was 392.2MB. Max. memory is 16.1GB. * Witness Printer took 295.49ms. Allocated memory is still 1.4GB. Free memory was 955.4MB in the beginning and 930.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 04:57:24,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8766cf0-380f-4b7f-b39a-b0acad01bd69/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE