./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.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_5fb35402-470a-45c4-8b2f-32517b5510af/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/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_5fb35402-470a-45c4-8b2f-32517b5510af/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/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_5fb35402-470a-45c4-8b2f-32517b5510af/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 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 05:07:34,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:07:34,078 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 05:07:34,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:07:34,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:07:34,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:07:34,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 05:07:34,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 05:07:34,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:07:34,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:07:34,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:07:34,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 05:07:34,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 05:07:34,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:07:34,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 05:07:34,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:07:34,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 05:07:34,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:07:34,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 05:07:34,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 05:07:34,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 05:07:34,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:07:34,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:07:34,103 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:07:34,104 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:07:34,104 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:07:34,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:07:34,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:07:34,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:07:34,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:07:34,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 05:07:34,104 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:07:34,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:07:34,104 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_5fb35402-470a-45c4-8b2f-32517b5510af/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 -> 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 [2024-12-06 05:07:34,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:07:34,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:07:34,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:07:34,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:07:34,328 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:07:34,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-12-06 05:07:37,091 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/bin/ukojak-verify-CZk0znPC7b/data/97dbfeb07/813215430feb4954a83353defbf07352/FLAG6d52fdec3 [2024-12-06 05:07:37,303 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:07:37,303 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-12-06 05:07:37,314 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/bin/ukojak-verify-CZk0znPC7b/data/97dbfeb07/813215430feb4954a83353defbf07352/FLAG6d52fdec3 [2024-12-06 05:07:37,328 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/bin/ukojak-verify-CZk0znPC7b/data/97dbfeb07/813215430feb4954a83353defbf07352 [2024-12-06 05:07:37,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:07:37,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:07:37,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:07:37,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:07:37,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:07:37,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0f897a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37, skipping insertion in model container [2024-12-06 05:07:37,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:07:37,570 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_5fb35402-470a-45c4-8b2f-32517b5510af/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2024-12-06 05:07:37,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:07:37,585 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:07:37,633 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_5fb35402-470a-45c4-8b2f-32517b5510af/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2024-12-06 05:07:37,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:07:37,649 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:07:37,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37 WrapperNode [2024-12-06 05:07:37,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:07:37,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:07:37,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:07:37,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:07:37,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,693 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-12-06 05:07:37,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:07:37,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:07:37,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:07:37,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:07:37,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,713 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:07:37,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:07:37,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:07:37,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:07:37,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:37" (1/1) ... [2024-12-06 05:07:37,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:07:37,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:07:37,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:07:37,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:07:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 05:07:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 05:07:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:07:37,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:07:37,878 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:07:37,879 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:07:38,445 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-12-06 05:07:38,445 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:07:39,099 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:07:39,100 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 05:07:39,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:39 BoogieIcfgContainer [2024-12-06 05:07:39,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:07:39,101 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:07:39,101 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:07:39,110 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:07:39,111 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:39" (1/1) ... [2024-12-06 05:07:39,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:07:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-12-06 05:07:39,168 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-12-06 05:07:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 05:07:39,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:39,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:41,426 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 05:07:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-12-06 05:07:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-12-06 05:07:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 05:07:41,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:41,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:42,533 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 05:07:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-12-06 05:07:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-12-06 05:07:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 05:07:42,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:42,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:43,602 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 05:07:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-12-06 05:07:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-12-06 05:07:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 05:07:44,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:44,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:45,002 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 05:07:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-12-06 05:07:45,664 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-12-06 05:07:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 05:07:45,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:45,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:46,566 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 05:07:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 37 states and 65 transitions. [2024-12-06 05:07:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 65 transitions. [2024-12-06 05:07:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 05:07:46,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:46,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:47,703 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 05:07:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 43 states and 77 transitions. [2024-12-06 05:07:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2024-12-06 05:07:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 05:07:48,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:48,652 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 05:07:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 44 states and 77 transitions. [2024-12-06 05:07:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 77 transitions. [2024-12-06 05:07:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:07:48,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:48,992 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 05:07:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2024-12-06 05:07:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2024-12-06 05:07:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:07:49,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:49,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:50,146 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 05:07:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 55 states and 95 transitions. [2024-12-06 05:07:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 95 transitions. [2024-12-06 05:07:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 05:07:51,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:51,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:51,893 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 05:07:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 58 states and 101 transitions. [2024-12-06 05:07:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2024-12-06 05:07:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 05:07:52,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:54,366 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 05:07:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:07:57,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 74 states and 127 transitions. [2024-12-06 05:07:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 127 transitions. [2024-12-06 05:07:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 05:07:57,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:07:57,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:07:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:07:58,286 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 05:08:00,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 88 states and 152 transitions. [2024-12-06 05:08:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2024-12-06 05:08:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 05:08:00,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:00,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:01,778 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 05:08:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 96 states and 169 transitions. [2024-12-06 05:08:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 169 transitions. [2024-12-06 05:08:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 05:08:04,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:04,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:05,265 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 05:08:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 103 states and 189 transitions. [2024-12-06 05:08:07,356 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2024-12-06 05:08:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:08:07,357 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:07,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:08,541 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 05:08:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 117 states and 214 transitions. [2024-12-06 05:08:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 214 transitions. [2024-12-06 05:08:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:08:11,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:11,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:12,537 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 05:08:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 120 states and 226 transitions. [2024-12-06 05:08:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 226 transitions. [2024-12-06 05:08:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:08:13,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:13,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:14,532 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 05:08:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 121 states and 227 transitions. [2024-12-06 05:08:14,889 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 227 transitions. [2024-12-06 05:08:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 05:08:14,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:17,081 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 05:08:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 140 states and 255 transitions. [2024-12-06 05:08:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 255 transitions. [2024-12-06 05:08:21,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 05:08:21,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:21,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:22,543 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 05:08:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 145 states and 268 transitions. [2024-12-06 05:08:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 268 transitions. [2024-12-06 05:08:24,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 05:08:24,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:24,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:26,765 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 05:08:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 157 states and 295 transitions. [2024-12-06 05:08:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 295 transitions. [2024-12-06 05:08:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 05:08:31,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:31,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:32,891 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 05:08:33,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 156 states and 285 transitions. [2024-12-06 05:08:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 285 transitions. [2024-12-06 05:08:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 05:08:33,624 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:33,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:36,099 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 05:08:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 170 states and 330 transitions. [2024-12-06 05:08:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 330 transitions. [2024-12-06 05:08:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 05:08:42,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:42,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:45,051 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 05:08:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 179 states and 349 transitions. [2024-12-06 05:08:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 349 transitions. [2024-12-06 05:08:50,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:08:50,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:50,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:08:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 05:08:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:08:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 193 states and 377 transitions. [2024-12-06 05:08:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 377 transitions. [2024-12-06 05:08:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:08:57,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:08:57,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:08:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:09:00,423 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 05:09:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:09:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 202 states and 396 transitions. [2024-12-06 05:09:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 396 transitions. [2024-12-06 05:09:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:09:05,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:09:05,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:09:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:09:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 05:09:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:09:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 203 states and 400 transitions. [2024-12-06 05:09:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 400 transitions. [2024-12-06 05:09:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 05:09:07,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:09:07,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:09:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:09:10,342 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 05:09:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:09:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 216 states and 420 transitions. [2024-12-06 05:09:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 420 transitions. [2024-12-06 05:09:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 05:09:17,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:09:17,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:09:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:09:19,369 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 05:09:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:09:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 227 states and 440 transitions. [2024-12-06 05:09:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 440 transitions. [2024-12-06 05:09:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 05:09:24,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:09:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:09:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:09:26,424 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 05:09:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:09:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 229 states and 445 transitions. [2024-12-06 05:09:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 445 transitions. [2024-12-06 05:09:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 05:09:28,077 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:09:28,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:09:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:09:29,872 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 05:09:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:09:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 235 states and 466 transitions. [2024-12-06 05:09:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 466 transitions. [2024-12-06 05:09:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 05:09:35,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:09:35,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:09:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:09:38,700 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 05:09:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:09:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 237 states and 466 transitions. [2024-12-06 05:09:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 466 transitions. [2024-12-06 05:09:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 05:09:41,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:09:41,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:09:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:09:45,985 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 05:09:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:09:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 243 states and 482 transitions. [2024-12-06 05:09:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 482 transitions. [2024-12-06 05:09:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 05:09:53,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:09:53,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:09:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:09:54,570 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 05:09:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:09:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 244 states and 486 transitions. [2024-12-06 05:09:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 486 transitions. [2024-12-06 05:09:55,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 05:09:55,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:09:55,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:09:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:09:58,811 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 05:10:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 249 states and 495 transitions. [2024-12-06 05:10:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 495 transitions. [2024-12-06 05:10:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:10:04,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:04,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:07,130 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 05:10:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 258 states and 515 transitions. [2024-12-06 05:10:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 515 transitions. [2024-12-06 05:10:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:10:15,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:15,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:17,939 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 05:10:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 260 states and 520 transitions. [2024-12-06 05:10:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 520 transitions. [2024-12-06 05:10:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:10:19,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:19,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:21,396 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 05:10:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 262 states and 536 transitions. [2024-12-06 05:10:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 536 transitions. [2024-12-06 05:10:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:10:23,792 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:10:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 273 states and 559 transitions. [2024-12-06 05:10:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 559 transitions. [2024-12-06 05:10:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:10:38,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:38,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:40,504 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 05:10:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 275 states and 560 transitions. [2024-12-06 05:10:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 560 transitions. [2024-12-06 05:10:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:10:42,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:42,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:43,745 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 05:10:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 276 states and 561 transitions. [2024-12-06 05:10:44,608 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 561 transitions. [2024-12-06 05:10:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:10:44,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:44,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:46,261 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 05:10:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 277 states and 573 transitions. [2024-12-06 05:10:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 573 transitions. [2024-12-06 05:10:47,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:10:47,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:47,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:49,106 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 05:10:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:10:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 278 states and 573 transitions. [2024-12-06 05:10:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 573 transitions. [2024-12-06 05:10:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:10:50,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:10:50,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:10:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:10:52,753 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 05:11:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 293 states and 606 transitions. [2024-12-06 05:11:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 606 transitions. [2024-12-06 05:11:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 05:11:00,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:00,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:02,869 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 05:11:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 295 states and 612 transitions. [2024-12-06 05:11:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 612 transitions. [2024-12-06 05:11:06,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 05:11:06,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:06,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:07,992 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 05:11:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 299 states and 627 transitions. [2024-12-06 05:11:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 627 transitions. [2024-12-06 05:11:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 05:11:11,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:11,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:13,016 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 05:11:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 300 states and 628 transitions. [2024-12-06 05:11:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 628 transitions. [2024-12-06 05:11:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 05:11:14,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:14,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:15,671 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 05:11:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 301 states and 629 transitions. [2024-12-06 05:11:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 629 transitions. [2024-12-06 05:11:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 05:11:16,794 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:16,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:20,490 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 05:11:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 303 states and 633 transitions. [2024-12-06 05:11:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 633 transitions. [2024-12-06 05:11:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 05:11:25,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:25,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:27,947 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 05:11:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 313 states and 661 transitions. [2024-12-06 05:11:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 661 transitions. [2024-12-06 05:11:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 05:11:37,209 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:37,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 316 states and 668 transitions. [2024-12-06 05:11:44,433 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 668 transitions. [2024-12-06 05:11:44,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 05:11:44,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:44,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:46,463 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 05:11:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 318 states and 671 transitions. [2024-12-06 05:11:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 671 transitions. [2024-12-06 05:11:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 05:11:48,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:48,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:11:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 319 states and 672 transitions. [2024-12-06 05:11:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 672 transitions. [2024-12-06 05:11:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-06 05:11:52,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:52,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:11:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 05:11:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:11:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 319 states and 671 transitions. [2024-12-06 05:11:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 671 transitions. [2024-12-06 05:11:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 05:11:53,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:11:53,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:11:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 05:11:53,992 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 05:11:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 05:11:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 05:11:55,443 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 05:11:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 05:11:55,993 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 54 iterations. [2024-12-06 05:11:56,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 05:11:56 ImpRootNode [2024-12-06 05:11:56,081 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 05:11:56,082 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 05:11:56,082 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 05:11:56,082 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 05:11:56,082 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:39" (3/4) ... [2024-12-06 05:11:56,083 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 05:11:56,203 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 193. [2024-12-06 05:11:56,309 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 05:11:56,309 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 05:11:56,309 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 05:11:56,310 INFO L158 Benchmark]: Toolchain (without parser) took 258978.22ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 118.2MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-12-06 05:11:56,311 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 142.6MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:11:56,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.20ms. Allocated memory is still 142.6MB. Free memory was 118.0MB in the beginning and 100.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 05:11:56,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.15ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 97.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:11:56,311 INFO L158 Benchmark]: Boogie Preprocessor took 35.10ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.9MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:11:56,312 INFO L158 Benchmark]: RCFGBuilder took 1370.82ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 80.5MB in the end (delta: 14.2MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2024-12-06 05:11:56,312 INFO L158 Benchmark]: CodeCheck took 256980.07ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 80.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-12-06 05:11:56,312 INFO L158 Benchmark]: Witness Printer took 227.99ms. Allocated memory is still 2.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-06 05:11:56,314 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: 256.9s, OverallIterations: 54, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23308 SdHoareTripleChecker+Valid, 134.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21464 mSDsluCounter, 7034 SdHoareTripleChecker+Invalid, 121.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6171 mSDsCounter, 8815 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63546 IncrementalHoareTripleChecker+Invalid, 72361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8815 mSolverCounterUnsat, 863 mSDtfsCounter, 63546 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15828 GetRequests, 13716 SyntacticMatches, 936 SemanticMatches, 1176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922940 ImplicationChecksByTransitivity, 176.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 90.5s InterpolantComputationTime, 1649 NumberOfCodeBlocks, 1649 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1548 ConstructedInterpolants, 0 QuantifiedInterpolants, 15550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 12 PerfectInterpolantSequences, 242/1065 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: 609]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L563] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND TRUE \read(r121) [L269] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND TRUE \read(r131) [L282] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND TRUE \read(r211) [L295] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND FALSE !(\read(r231)) [L310] COND TRUE \read(r211) [L311] COND TRUE \read(ep13) [L312] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND TRUE \read(r321) [L324] COND TRUE \read(ep21) [L325] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND TRUE \read(r321) [L334] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=0, m2=0, m3=3, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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] [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND TRUE \read(newmax2) [L171] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND TRUE \read(newmax3) [L230] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=0, m2=0, m3=3, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=0, m2=0, m3=3, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=0, m2=0, m3=3, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=0, m2=0, m3=3, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=0, m2=0, m3=3, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=0, m2=0, m3=3, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=0, m2=0, m3=3, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=0, m2=0, m3=3, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=0, m2=0, m3=3, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=0, m2=0, m3=3, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=0, m2=0, m3=3, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=0, m2=0, m3=3, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, 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=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND FALSE !((int )m1 > (int )max1) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND TRUE (int )m2 > (int )max2 [L146] max2 = m2 [L147] newmax = (_Bool)1 [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND TRUE (int )m2 > (int )max2 [L154] max2 = m2 [L155] newmax = (_Bool)1 [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=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] [L596] RET assert(c1) [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND FALSE !(\read(newmax1)) [L120] COND TRUE \read(ep13) [L121] COND FALSE !(\read(newmax1)) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND TRUE \read(newmax2) [L171] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND FALSE !(\read(newmax3)) [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=3, 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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=3, 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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=3, 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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=3, 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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=3, 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] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=3, 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] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=3, 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] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=3, 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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=3, 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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=3, 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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=3, 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] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=1, m2=3, m3=2, max1=2, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=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=3, 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] [L596] RET assert(c1) [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND TRUE (int )m1 > (int )max1 [L92] max1 = m1 [L93] newmax = (_Bool)1 [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] st1 = (char)1 [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND FALSE !((int )max2 == (int )id2) [L163] nl2 = (char)1 [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=3, m2=-1, m3=-1, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=0, st3=1] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=3, m2=-1, m3=-1, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=0, st3=1, tmp=0] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND TRUE ! arg VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=3, m2=-1, m3=-1, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=0, st3=1] [L609] reach_error() VAL [ep12=1, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=1, id3=3, m1=3, m2=-1, m3=-1, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 142.6MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.20ms. Allocated memory is still 142.6MB. Free memory was 118.0MB in the beginning and 100.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.15ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 97.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.10ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 94.9MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1370.82ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 80.5MB in the end (delta: 14.2MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * CodeCheck took 256980.07ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 80.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 227.99ms. Allocated memory is still 2.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 05:11:56,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fb35402-470a-45c4-8b2f-32517b5510af/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