./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm --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 a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:30:06,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:30:07,059 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:30:07,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:30:07,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:30:07,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:30:07,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:30:07,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:30:07,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:30:07,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:30:07,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:30:07,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:30:07,092 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:30:07,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:30:07,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:30:07,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:30:07,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:30:07,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:30:07,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:30:07,094 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:30:07,094 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:30:07,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:30:07,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:30:07,094 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:30:07,094 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:30:07,095 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:30:07,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:30:07,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:30:07,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:30:07,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:30:07,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:30:07,096 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:30:07,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:30:07,096 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_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm 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 -> a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec [2024-11-13 21:30:07,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:30:07,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:30:07,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:30:07,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:30:07,407 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:30:07,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-13 21:30:09,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:30:09,616 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:30:09,619 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-11-13 21:30:09,638 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/data/8706e5826/c2f7d073a98146b48178ad94ba345f6f/FLAGe1206c1fc [2024-11-13 21:30:09,656 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/data/8706e5826/c2f7d073a98146b48178ad94ba345f6f [2024-11-13 21:30:09,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:30:09,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:30:09,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:30:09,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:30:09,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:30:09,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:30:09" (1/1) ... [2024-11-13 21:30:09,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ec6311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:30:09, skipping insertion in model container [2024-11-13 21:30:09,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:30:09" (1/1) ... [2024-11-13 21:30:09,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:30:10,090 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_574bb6b2-be2c-4248-b709-b395a65dc8af/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2024-11-13 21:30:10,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:30:10,112 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:30:10,227 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_574bb6b2-be2c-4248-b709-b395a65dc8af/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2024-11-13 21:30:10,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:30:10,251 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:30:10,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:30:10 WrapperNode [2024-11-13 21:30:10,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:30:10,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:30:10,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:30:10,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:30:10,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:30:10" (1/1) ... [2024-11-13 21:30:10,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:30:10" (1/1) ... [2024-11-13 21:30:10,329 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 483 [2024-11-13 21:30:10,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:30:10,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:30:10,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:30:10,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:30:10,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:30:10" (1/1) ... [2024-11-13 21:30:10,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:30:10" (1/1) ... [2024-11-13 21:30:10,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:30:10" (1/1) ... [2024-11-13 21:30:10,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:30:10" (1/1) ... [2024-11-13 21:30:10,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:30:10" (1/1) ... [2024-11-13 21:30:10,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:30:10" (1/1) ... [2024-11-13 21:30:10,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:30:10" (1/1) ... [2024-11-13 21:30:10,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:30:10" (1/1) ... [2024-11-13 21:30:10,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:30:10,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:30:10,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:30:10,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:30:10,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:30:10" (1/1) ... [2024-11-13 21:30:10,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:30:10,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:30:10,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:30:10,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:30:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:30:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:30:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:30:10,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:30:10,601 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:30:10,604 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:30:11,354 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-13 21:30:11,355 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:30:12,162 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:30:12,163 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 21:30:12,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:30:12 BoogieIcfgContainer [2024-11-13 21:30:12,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:30:12,164 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:30:12,164 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:30:12,176 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:30:12,177 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:30:12" (1/1) ... [2024-11-13 21:30:12,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:30:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-13 21:30:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-13 21:30:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 21:30:12,260 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:15,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-13 21:30:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-13 21:30:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 21:30:15,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:15,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-13 21:30:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-13 21:30:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 21:30:16,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:16,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-13 21:30:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-13 21:30:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 21:30:18,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:18,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:19,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-13 21:30:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-13 21:30:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 21:30:20,469 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:20,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-11-13 21:30:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-11-13 21:30:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 21:30:22,915 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-11-13 21:30:25,294 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-11-13 21:30:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 21:30:25,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:25,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-11-13 21:30:25,897 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-11-13 21:30:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:30:25,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:25,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:26,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2024-11-13 21:30:26,111 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2024-11-13 21:30:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 21:30:26,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2024-11-13 21:30:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2024-11-13 21:30:29,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 21:30:29,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:29,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2024-11-13 21:30:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2024-11-13 21:30:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 21:30:30,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 76 states and 132 transitions. [2024-11-13 21:30:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2024-11-13 21:30:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:30:37,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:37,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 90 states and 162 transitions. [2024-11-13 21:30:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 162 transitions. [2024-11-13 21:30:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-13 21:30:42,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:42,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 92 states and 166 transitions. [2024-11-13 21:30:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 166 transitions. [2024-11-13 21:30:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:30:44,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:44,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 106 states and 205 transitions. [2024-11-13 21:30:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 205 transitions. [2024-11-13 21:30:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:30:50,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:50,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 108 states and 214 transitions. [2024-11-13 21:30:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 214 transitions. [2024-11-13 21:30:52,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 21:30:52,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:52,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 110 states and 220 transitions. [2024-11-13 21:30:54,210 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 220 transitions. [2024-11-13 21:30:54,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:30:54,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:54,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:30:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:30:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:30:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 124 states and 251 transitions. [2024-11-13 21:30:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 251 transitions. [2024-11-13 21:30:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:30:59,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:30:59,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:30:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:31:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:31:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:31:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 130 states and 275 transitions. [2024-11-13 21:31:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 275 transitions. [2024-11-13 21:31:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:31:04,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:31:04,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:31:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:31:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:31:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:31:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 133 states and 287 transitions. [2024-11-13 21:31:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 287 transitions. [2024-11-13 21:31:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:31:06,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:31:06,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:31:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:31:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:31:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:31:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 134 states and 290 transitions. [2024-11-13 21:31:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 290 transitions. [2024-11-13 21:31:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:31:07,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:31:07,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:31:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:31:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:31:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:31:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 135 states and 291 transitions. [2024-11-13 21:31:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 291 transitions. [2024-11-13 21:31:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-13 21:31:08,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:31:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:31:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:31:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:31:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:31:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 136 states and 293 transitions. [2024-11-13 21:31:10,378 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 293 transitions. [2024-11-13 21:31:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 21:31:10,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:31:10,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:31:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:31:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:31:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:31:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 156 states and 334 transitions. [2024-11-13 21:31:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 334 transitions. [2024-11-13 21:31:19,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-13 21:31:19,595 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:31:19,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:31:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:31:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:31:22,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:31:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 161 states and 350 transitions. [2024-11-13 21:31:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 350 transitions. [2024-11-13 21:31:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-13 21:31:22,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:31:22,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:31:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:31:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:31:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:31:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 170 states and 373 transitions. [2024-11-13 21:31:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 373 transitions. [2024-11-13 21:31:30,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-13 21:31:30,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:31:30,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:31:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:31:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:31:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:31:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 169 states and 364 transitions. [2024-11-13 21:31:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 364 transitions. [2024-11-13 21:31:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:31:33,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:31:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:31:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:31:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:31:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:31:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 183 states and 418 transitions. [2024-11-13 21:31:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 418 transitions. [2024-11-13 21:31:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-13 21:31:45,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:31:45,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:31:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:31:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:32:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 197 states and 476 transitions. [2024-11-13 21:32:00,289 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 476 transitions. [2024-11-13 21:32:00,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:32:00,290 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:00,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:32:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 208 states and 505 transitions. [2024-11-13 21:32:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 505 transitions. [2024-11-13 21:32:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:32:09,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:09,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:32:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 217 states and 528 transitions. [2024-11-13 21:32:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 528 transitions. [2024-11-13 21:32:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:32:17,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:17,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:32:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 218 states and 541 transitions. [2024-11-13 21:32:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 541 transitions. [2024-11-13 21:32:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:32:19,981 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:19,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:32:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 232 states and 571 transitions. [2024-11-13 21:32:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 571 transitions. [2024-11-13 21:32:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:32:35,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:35,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:32:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 241 states and 599 transitions. [2024-11-13 21:32:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 599 transitions. [2024-11-13 21:32:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 21:32:44,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:44,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:32:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:32:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 245 states and 605 transitions. [2024-11-13 21:32:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 605 transitions. [2024-11-13 21:32:53,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:32:53,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:32:53,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:32:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:32:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 255 states and 632 transitions. [2024-11-13 21:33:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 632 transitions. [2024-11-13 21:33:04,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:33:04,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 264 states and 653 transitions. [2024-11-13 21:33:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 653 transitions. [2024-11-13 21:33:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 21:33:12,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:12,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 268 states and 669 transitions. [2024-11-13 21:33:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 669 transitions. [2024-11-13 21:33:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:33:18,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:18,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 278 states and 702 transitions. [2024-11-13 21:33:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 702 transitions. [2024-11-13 21:33:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:33:35,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:35,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 281 states and 721 transitions. [2024-11-13 21:33:43,593 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 721 transitions. [2024-11-13 21:33:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-13 21:33:43,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:33:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:33:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 285 states and 735 transitions. [2024-11-13 21:33:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 735 transitions. [2024-11-13 21:33:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:33:52,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:33:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:33:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:33:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 297 states and 765 transitions. [2024-11-13 21:34:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 765 transitions. [2024-11-13 21:34:03,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:34:03,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 298 states and 772 transitions. [2024-11-13 21:34:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 772 transitions. [2024-11-13 21:34:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:34:08,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:08,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 303 states and 791 transitions. [2024-11-13 21:34:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 791 transitions. [2024-11-13 21:34:15,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:34:15,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:15,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 304 states and 793 transitions. [2024-11-13 21:34:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 793 transitions. [2024-11-13 21:34:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:34:20,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:20,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 305 states and 796 transitions. [2024-11-13 21:34:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 796 transitions. [2024-11-13 21:34:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-13 21:34:23,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 306 states and 799 transitions. [2024-11-13 21:34:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 799 transitions. [2024-11-13 21:34:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:34:26,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:26,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 317 states and 832 transitions. [2024-11-13 21:34:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 832 transitions. [2024-11-13 21:34:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:34:42,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:34:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:34:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:34:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 321 states and 843 transitions. [2024-11-13 21:34:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 843 transitions. [2024-11-13 21:34:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:34:57,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:34:57,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:34:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:00,671 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:35:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 326 states and 864 transitions. [2024-11-13 21:35:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 864 transitions. [2024-11-13 21:35:07,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-13 21:35:07,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:07,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:35:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 331 states and 875 transitions. [2024-11-13 21:35:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 875 transitions. [2024-11-13 21:35:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 21:35:16,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:16,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:35:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 21:35:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:35:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 331 states and 874 transitions. [2024-11-13 21:35:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 874 transitions. [2024-11-13 21:35:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 21:35:18,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:35:18,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:35:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:35:19,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:35:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:35:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:35:20,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:35:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:35:21,095 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 52 iterations. [2024-11-13 21:35:21,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:35:21 ImpRootNode [2024-11-13 21:35:21,243 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:35:21,244 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:35:21,244 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:35:21,244 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:35:21,245 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:30:12" (3/4) ... [2024-11-13 21:35:21,246 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 21:35:21,436 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:35:21,436 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:35:21,437 INFO L158 Benchmark]: Toolchain (without parser) took 311777.30ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 118.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-13 21:35:21,438 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 142.6MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:35:21,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.71ms. Allocated memory is still 142.6MB. Free memory was 118.8MB in the beginning and 101.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:35:21,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.43ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 98.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:35:21,439 INFO L158 Benchmark]: Boogie Preprocessor took 42.81ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 21:35:21,440 INFO L158 Benchmark]: RCFGBuilder took 1789.66ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 55.7MB in the end (delta: 40.2MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2024-11-13 21:35:21,440 INFO L158 Benchmark]: CodeCheck took 309078.70ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 55.7MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-13 21:35:21,441 INFO L158 Benchmark]: Witness Printer took 192.65ms. Allocated memory is still 2.7GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:35:21,447 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: 308.9s, OverallIterations: 52, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20239 SdHoareTripleChecker+Valid, 158.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18515 mSDsluCounter, 7895 SdHoareTripleChecker+Invalid, 142.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7066 mSDsCounter, 6921 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61454 IncrementalHoareTripleChecker+Invalid, 68375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6921 mSolverCounterUnsat, 829 mSDtfsCounter, 61454 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14668 GetRequests, 12739 SyntacticMatches, 767 SemanticMatches, 1162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893667 ImplicationChecksByTransitivity, 230.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 88.0s InterpolantComputationTime, 1491 NumberOfCodeBlocks, 1491 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1392 ConstructedInterpolants, 0 QuantifiedInterpolants, 11763 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 11 PerfectInterpolantSequences, 194/875 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 - CounterExampleResult [Line: 585]: 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 ; [L504] int c1 ; [L505] int i2 ; [L508] c1 = 0 [L509] ep12 = __VERIFIER_nondet_bool() [L510] ep13 = __VERIFIER_nondet_bool() [L511] ep21 = __VERIFIER_nondet_bool() [L512] ep23 = __VERIFIER_nondet_bool() [L513] ep31 = __VERIFIER_nondet_bool() [L514] ep32 = __VERIFIER_nondet_bool() [L515] id1 = __VERIFIER_nondet_char() [L516] r1 = __VERIFIER_nondet_uchar() [L517] st1 = __VERIFIER_nondet_char() [L518] nl1 = __VERIFIER_nondet_char() [L519] m1 = __VERIFIER_nondet_char() [L520] max1 = __VERIFIER_nondet_char() [L521] mode1 = __VERIFIER_nondet_bool() [L522] newmax1 = __VERIFIER_nondet_bool() [L523] id2 = __VERIFIER_nondet_char() [L524] r2 = __VERIFIER_nondet_uchar() [L525] st2 = __VERIFIER_nondet_char() [L526] nl2 = __VERIFIER_nondet_char() [L527] m2 = __VERIFIER_nondet_char() [L528] max2 = __VERIFIER_nondet_char() [L529] mode2 = __VERIFIER_nondet_bool() [L530] newmax2 = __VERIFIER_nondet_bool() [L531] id3 = __VERIFIER_nondet_char() [L532] r3 = __VERIFIER_nondet_uchar() [L533] st3 = __VERIFIER_nondet_char() [L534] nl3 = __VERIFIER_nondet_char() [L535] m3 = __VERIFIER_nondet_char() [L536] max3 = __VERIFIER_nondet_char() [L537] mode3 = __VERIFIER_nondet_bool() [L538] newmax3 = __VERIFIER_nondet_bool() [L539] 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 FALSE !(\read(r121)) [L271] COND FALSE !(\read(r131)) [L278] tmp = 0 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND FALSE !(\read(r121)) [L291] tmp___0 = 0 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND FALSE !(\read(r231)) [L304] tmp___1 = 0 [L306] r212 = (_Bool )tmp___1 [L307] COND FALSE !(\read(r231)) [L310] COND FALSE !(\read(r211)) [L317] tmp___2 = 0 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND FALSE !(\read(r321)) [L330] tmp___3 = 0 [L332] r312 = (_Bool )tmp___3 [L333] COND FALSE !(\read(r321)) [L336] COND FALSE !(\read(r311)) [L343] tmp___4 = 0 [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 (int )max1 == (int )id1 [L356] COND TRUE (int )max2 == (int )id2 [L357] COND TRUE (int )max3 == (int )id3 [L358] COND TRUE (int )st1 == 0 [L359] COND TRUE (int )st2 == 0 [L360] COND TRUE (int )st3 == 0 [L361] COND TRUE (int )nl1 == 0 [L362] COND TRUE (int )nl2 == 0 [L363] COND TRUE (int )nl3 == 0 [L364] COND TRUE (int )mode1 == 0 [L365] COND TRUE (int )mode2 == 0 [L366] COND TRUE (int )mode3 == 0 [L367] COND TRUE \read(newmax1) [L368] COND TRUE \read(newmax2) [L369] COND TRUE \read(newmax3) [L370] tmp___5 = 1 [L443] return (tmp___5); [L539] RET, EXPR init() [L539] i2 = init() [L540] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L540] RET assume_abort_if_not(i2) [L541] p12_old = nomsg [L542] p12_new = nomsg [L543] p13_old = nomsg [L544] p13_new = nomsg [L545] p21_old = nomsg [L546] p21_new = nomsg [L547] p23_old = nomsg [L548] p23_new = nomsg [L549] p31_old = nomsg [L550] p31_new = nomsg [L551] p32_old = nomsg [L552] p32_new = nomsg [L553] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, 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] [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L557] RET node2() [L558] 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 FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, 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=-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] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, 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=-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] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, 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=-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] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, 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=-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] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, 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=-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] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, 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=-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] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, 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=-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] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, 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=-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] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, 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=-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] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, 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=-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] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, 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=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, 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=-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] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] 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 FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] 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 FALSE !(\read(ep12)) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] 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 FALSE !(\read(ep13)) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L557] RET node2() [L558] 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 FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] 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 FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND TRUE (int )max1 == (int )id1 [L107] st1 = (char)1 [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] 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 FALSE !(\read(ep12)) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (char)1 [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] 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 FALSE !(\read(ep13)) [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 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L451] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L497] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=2, r2=2, r3=2, st1=1, st2=1, st3=1, tmp=0] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L585] reach_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=0, id3=1, m1=127, m2=1, m3=1, max1=126, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 142.6MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.71ms. Allocated memory is still 142.6MB. Free memory was 118.8MB in the beginning and 101.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.43ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 98.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.81ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.9MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1789.66ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 55.7MB in the end (delta: 40.2MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * CodeCheck took 309078.70ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 55.7MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 192.65ms. Allocated memory is still 2.7GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 21:35:21,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574bb6b2-be2c-4248-b709-b395a65dc8af/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, 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