./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk --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 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:39:11,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:39:11,554 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 19:39:11,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:39:11,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 19:39:11,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:39:11,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:39:11,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 19:39:11,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:39:11,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:39:11,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:39:11,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:39:11,596 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:39:11,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:39:11,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:39:11,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:39:11,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:39:11,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:39:11,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:39:11,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:39:11,601 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:39:11,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:39:11,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:39:11,607 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 19:39:11,607 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 19:39:11,608 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 19:39:11,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:39:11,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:39:11,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:39:11,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:39:11,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:39:11,610 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 19:39:11,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:39:11,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk 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 -> 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 [2024-11-08 19:39:11,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:39:11,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:39:11,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:39:11,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:39:11,947 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:39:11,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-08 19:39:13,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:39:14,180 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:39:14,181 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-11-08 19:39:14,192 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/data/519a9d622/d9f2842bc30640d98d37bd79df24a695/FLAGbe3bd84cd [2024-11-08 19:39:14,213 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/data/519a9d622/d9f2842bc30640d98d37bd79df24a695 [2024-11-08 19:39:14,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:39:14,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:39:14,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:39:14,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:39:14,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:39:14,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:39:14" (1/1) ... [2024-11-08 19:39:14,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c517d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:14, skipping insertion in model container [2024-11-08 19:39:14,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:39:14" (1/1) ... [2024-11-08 19:39:14,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:39:14,559 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_83583f08-78fc-48d8-adea-a4d8a8b33d3d/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2024-11-08 19:39:14,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:39:14,576 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:39:14,665 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_83583f08-78fc-48d8-adea-a4d8a8b33d3d/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2024-11-08 19:39:14,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:39:14,691 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:39:14,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:14 WrapperNode [2024-11-08 19:39:14,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:39:14,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:39:14,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:39:14,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:39:14,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:14" (1/1) ... [2024-11-08 19:39:14,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:14" (1/1) ... [2024-11-08 19:39:14,754 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-11-08 19:39:14,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:39:14,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:39:14,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:39:14,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:39:14,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:14" (1/1) ... [2024-11-08 19:39:14,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:14" (1/1) ... [2024-11-08 19:39:14,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:14" (1/1) ... [2024-11-08 19:39:14,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:14" (1/1) ... [2024-11-08 19:39:14,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:14" (1/1) ... [2024-11-08 19:39:14,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:14" (1/1) ... [2024-11-08 19:39:14,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:14" (1/1) ... [2024-11-08 19:39:14,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:14" (1/1) ... [2024-11-08 19:39:14,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:39:14,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:39:14,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:39:14,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:39:14,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:39:14" (1/1) ... [2024-11-08 19:39:14,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:39:14,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 19:39:14,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 19:39:14,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 19:39:14,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:39:14,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 19:39:14,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:39:14,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:39:15,021 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:39:15,023 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:39:15,803 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-08 19:39:15,804 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:39:16,807 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:39:16,807 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:39:16,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:39:16 BoogieIcfgContainer [2024-11-08 19:39:16,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:39:16,809 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 19:39:16,810 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 19:39:16,830 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 19:39:16,831 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:39:16" (1/1) ... [2024-11-08 19:39:16,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:39:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2024-11-08 19:39:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2024-11-08 19:39:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 19:39:16,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:16,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:20,841 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-08 19:39:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:21,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 24 states and 39 transitions. [2024-11-08 19:39:21,039 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2024-11-08 19:39:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:39:21,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:23,184 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-08 19:39:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 28 states and 48 transitions. [2024-11-08 19:39:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2024-11-08 19:39:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 19:39:23,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:23,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:25,601 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-08 19:39:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 33 states and 59 transitions. [2024-11-08 19:39:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2024-11-08 19:39:26,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:39:26,409 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:26,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:28,150 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-08 19:39:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 39 states and 72 transitions. [2024-11-08 19:39:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 72 transitions. [2024-11-08 19:39:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:39:29,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:31,445 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-08 19:39:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 47 states and 88 transitions. [2024-11-08 19:39:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 88 transitions. [2024-11-08 19:39:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 19:39:32,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:32,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:34,637 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-08 19:39:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:36,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 54 states and 102 transitions. [2024-11-08 19:39:36,236 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 102 transitions. [2024-11-08 19:39:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:39:36,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:36,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:37,679 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-08 19:39:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 63 states and 119 transitions. [2024-11-08 19:39:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 119 transitions. [2024-11-08 19:39:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:39:39,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:39,350 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-08 19:39:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 64 states and 120 transitions. [2024-11-08 19:39:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 120 transitions. [2024-11-08 19:39:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:39:39,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:39,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:40,874 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-08 19:39:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 75 states and 140 transitions. [2024-11-08 19:39:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 140 transitions. [2024-11-08 19:39:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:39:42,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:42,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:44,197 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-08 19:39:44,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 80 states and 148 transitions. [2024-11-08 19:39:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 148 transitions. [2024-11-08 19:39:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:39:44,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:44,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:47,925 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-08 19:39:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 98 states and 185 transitions. [2024-11-08 19:39:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 185 transitions. [2024-11-08 19:39:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:39:52,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:52,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:55,250 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-08 19:39:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 113 states and 210 transitions. [2024-11-08 19:39:58,440 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 210 transitions. [2024-11-08 19:39:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:39:58,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:58,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:01,064 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-08 19:40:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 126 states and 235 transitions. [2024-11-08 19:40:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 235 transitions. [2024-11-08 19:40:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:40:04,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:04,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:06,339 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-08 19:40:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 141 states and 264 transitions. [2024-11-08 19:40:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 264 transitions. [2024-11-08 19:40:10,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:40:10,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:10,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:11,746 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-08 19:40:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 143 states and 269 transitions. [2024-11-08 19:40:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 269 transitions. [2024-11-08 19:40:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:40:12,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:12,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 158 states and 299 transitions. [2024-11-08 19:40:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 299 transitions. [2024-11-08 19:40:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:40:19,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:19,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 161 states and 307 transitions. [2024-11-08 19:40:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 307 transitions. [2024-11-08 19:40:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:40:22,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:22,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 180 states and 336 transitions. [2024-11-08 19:40:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 336 transitions. [2024-11-08 19:40:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 19:40:28,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:28,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 185 states and 345 transitions. [2024-11-08 19:40:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 345 transitions. [2024-11-08 19:40:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 19:40:31,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:31,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:40:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 186 states and 346 transitions. [2024-11-08 19:40:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 346 transitions. [2024-11-08 19:40:32,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:40:32,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:32,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 201 states and 365 transitions. [2024-11-08 19:40:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 365 transitions. [2024-11-08 19:40:38,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:40:38,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:38,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 208 states and 379 transitions. [2024-11-08 19:40:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 379 transitions. [2024-11-08 19:40:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 19:40:43,624 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:43,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 19:40:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 209 states and 380 transitions. [2024-11-08 19:40:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 380 transitions. [2024-11-08 19:40:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 19:40:44,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:44,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:47,382 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:40:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:40:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 225 states and 434 transitions. [2024-11-08 19:40:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 434 transitions. [2024-11-08 19:40:54,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:40:54,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:40:54,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:40:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:40:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:41:03,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 237 states and 465 transitions. [2024-11-08 19:41:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 465 transitions. [2024-11-08 19:41:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:41:03,005 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:03,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:41:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 239 states and 469 transitions. [2024-11-08 19:41:05,439 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 469 transitions. [2024-11-08 19:41:05,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:41:05,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:05,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 19:41:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 253 states and 495 transitions. [2024-11-08 19:41:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 495 transitions. [2024-11-08 19:41:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 19:41:16,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:16,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:41:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 268 states and 533 transitions. [2024-11-08 19:41:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 533 transitions. [2024-11-08 19:41:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 19:41:33,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:33,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:41:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:43,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 273 states and 547 transitions. [2024-11-08 19:41:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 547 transitions. [2024-11-08 19:41:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 19:41:43,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:43,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:41:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 274 states and 548 transitions. [2024-11-08 19:41:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 548 transitions. [2024-11-08 19:41:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:41:47,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:47,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:41:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 279 states and 563 transitions. [2024-11-08 19:41:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 563 transitions. [2024-11-08 19:41:52,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:41:52,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:52,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:41:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:41:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 283 states and 577 transitions. [2024-11-08 19:41:56,650 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 577 transitions. [2024-11-08 19:41:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:41:56,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:41:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:41:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:41:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:42:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:42:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 285 states and 580 transitions. [2024-11-08 19:42:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 580 transitions. [2024-11-08 19:42:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:42:00,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:42:00,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:42:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:42:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:42:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:42:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 297 states and 599 transitions. [2024-11-08 19:42:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 599 transitions. [2024-11-08 19:42:15,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:42:15,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:42:15,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:42:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:42:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:42:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:42:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 305 states and 625 transitions. [2024-11-08 19:42:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 625 transitions. [2024-11-08 19:42:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 19:42:29,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:42:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:42:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:42:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:42:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:42:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 309 states and 636 transitions. [2024-11-08 19:42:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 636 transitions. [2024-11-08 19:42:33,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 19:42:33,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:42:33,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:42:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:42:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:42:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:42:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 314 states and 647 transitions. [2024-11-08 19:42:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 647 transitions. [2024-11-08 19:42:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 19:42:41,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:42:41,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:42:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:42:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:42:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:42:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 321 states and 661 transitions. [2024-11-08 19:42:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 661 transitions. [2024-11-08 19:42:49,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 19:42:49,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:42:49,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:42:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:42:51,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:42:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:42:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:42:54,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:42:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:42:55,519 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 39 iterations. [2024-11-08 19:42:55,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 07:42:55 ImpRootNode [2024-11-08 19:42:55,776 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 19:42:55,776 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:42:55,777 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:42:55,777 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:42:55,778 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:39:16" (3/4) ... [2024-11-08 19:42:55,780 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 19:42:56,028 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 19:42:56,028 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:42:56,029 INFO L158 Benchmark]: Toolchain (without parser) took 221809.85ms. Allocated memory was 125.8MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 93.8MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 434.0MB. Max. memory is 16.1GB. [2024-11-08 19:42:56,030 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 100.7MB. Free memory is still 57.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:42:56,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.67ms. Allocated memory is still 125.8MB. Free memory was 93.8MB in the beginning and 74.0MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 19:42:56,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.60ms. Allocated memory is still 125.8MB. Free memory was 74.0MB in the beginning and 70.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:42:56,031 INFO L158 Benchmark]: Boogie Preprocessor took 78.60ms. Allocated memory is still 125.8MB. Free memory was 70.7MB in the beginning and 68.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:42:56,032 INFO L158 Benchmark]: RCFGBuilder took 1974.11ms. Allocated memory was 125.8MB in the beginning and 153.1MB in the end (delta: 27.3MB). Free memory was 67.8MB in the beginning and 87.0MB in the end (delta: -19.2MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2024-11-08 19:42:56,033 INFO L158 Benchmark]: CodeCheck took 218966.32ms. Allocated memory was 153.1MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 87.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 379.4MB. Max. memory is 16.1GB. [2024-11-08 19:42:56,033 INFO L158 Benchmark]: Witness Printer took 252.03ms. Allocated memory is still 2.4GB. Free memory was 2.0GB in the beginning and 1.9GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 19:42:56,036 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 218.7s, OverallIterations: 39, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13037 SdHoareTripleChecker+Valid, 109.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11798 mSDsluCounter, 8569 SdHoareTripleChecker+Invalid, 98.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5513 mSDsCounter, 4367 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32320 IncrementalHoareTripleChecker+Invalid, 36687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4367 mSolverCounterUnsat, 3056 mSDtfsCounter, 32320 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10872 GetRequests, 9563 SyntacticMatches, 403 SemanticMatches, 906 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501877 ImplicationChecksByTransitivity, 134.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 84.7s InterpolantComputationTime, 1115 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1025 ConstructedInterpolants, 0 QuantifiedInterpolants, 9776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 12 PerfectInterpolantSequences, 138/587 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: 600]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] msg_t nomsg = (msg_t )-1; [L28] port_t p12 ; [L29] char p12_old ; [L30] char p12_new ; [L31] _Bool ep12 ; [L32] port_t p13 ; [L33] char p13_old ; [L34] char p13_new ; [L35] _Bool ep13 ; [L36] port_t p21 ; [L37] char p21_old ; [L38] char p21_new ; [L39] _Bool ep21 ; [L40] port_t p23 ; [L41] char p23_old ; [L42] char p23_new ; [L43] _Bool ep23 ; [L44] port_t p31 ; [L45] char p31_old ; [L46] char p31_new ; [L47] _Bool ep31 ; [L48] port_t p32 ; [L49] char p32_old ; [L50] char p32_new ; [L51] _Bool ep32 ; [L52] char id1 ; [L53] char r1 ; [L54] char st1 ; [L55] char nl1 ; [L56] char m1 ; [L57] char max1 ; [L58] _Bool mode1 ; [L59] _Bool newmax1 ; [L60] char id2 ; [L61] char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] _Bool newmax2 ; [L68] char id3 ; [L69] char r3 ; [L70] char st3 ; [L71] char nl3 ; [L72] char m3 ; [L73] char max3 ; [L74] _Bool mode3 ; [L75] _Bool newmax3 ; [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] ep12 = __VERIFIER_nondet_bool() [L524] ep13 = __VERIFIER_nondet_bool() [L525] ep21 = __VERIFIER_nondet_bool() [L526] ep23 = __VERIFIER_nondet_bool() [L527] ep31 = __VERIFIER_nondet_bool() [L528] ep32 = __VERIFIER_nondet_bool() [L529] id1 = __VERIFIER_nondet_char() [L530] r1 = __VERIFIER_nondet_char() [L531] st1 = __VERIFIER_nondet_char() [L532] nl1 = __VERIFIER_nondet_char() [L533] m1 = __VERIFIER_nondet_char() [L534] max1 = __VERIFIER_nondet_char() [L535] mode1 = __VERIFIER_nondet_bool() [L536] newmax1 = __VERIFIER_nondet_bool() [L537] id2 = __VERIFIER_nondet_char() [L538] r2 = __VERIFIER_nondet_char() [L539] st2 = __VERIFIER_nondet_char() [L540] nl2 = __VERIFIER_nondet_char() [L541] m2 = __VERIFIER_nondet_char() [L542] max2 = __VERIFIER_nondet_char() [L543] mode2 = __VERIFIER_nondet_bool() [L544] newmax2 = __VERIFIER_nondet_bool() [L545] id3 = __VERIFIER_nondet_char() [L546] r3 = __VERIFIER_nondet_char() [L547] st3 = __VERIFIER_nondet_char() [L548] nl3 = __VERIFIER_nondet_char() [L549] m3 = __VERIFIER_nondet_char() [L550] max3 = __VERIFIER_nondet_char() [L551] mode3 = __VERIFIER_nondet_bool() [L552] newmax3 = __VERIFIER_nondet_bool() [L553] CALL, EXPR init() [L231] _Bool r121 ; [L232] _Bool r131 ; [L233] _Bool r211 ; [L234] _Bool r231 ; [L235] _Bool r311 ; [L236] _Bool r321 ; [L237] _Bool r122 ; [L238] int tmp ; [L239] _Bool r132 ; [L240] int tmp___0 ; [L241] _Bool r212 ; [L242] int tmp___1 ; [L243] _Bool r232 ; [L244] int tmp___2 ; [L245] _Bool r312 ; [L246] int tmp___3 ; [L247] _Bool r322 ; [L248] int tmp___4 ; [L249] int tmp___5 ; [L252] r121 = ep12 [L253] r131 = ep13 [L254] r211 = ep21 [L255] r231 = ep23 [L256] r311 = ep31 [L257] r321 = ep32 [L258] COND TRUE \read(r121) [L259] tmp = 1 [L270] r122 = (_Bool )tmp [L271] COND FALSE !(\read(r131)) [L274] COND TRUE \read(r121) [L275] COND TRUE \read(ep23) [L276] tmp___0 = 1 [L283] r132 = (_Bool )tmp___0 [L284] COND FALSE !(\read(r211)) [L287] COND TRUE \read(r231) [L288] COND TRUE \read(ep31) [L289] tmp___1 = 1 [L296] r212 = (_Bool )tmp___1 [L297] COND TRUE \read(r231) [L298] tmp___2 = 1 [L309] r232 = (_Bool )tmp___2 [L310] COND TRUE \read(r311) [L311] tmp___3 = 1 [L322] r312 = (_Bool )tmp___3 [L323] COND FALSE !(\read(r321)) [L326] COND TRUE \read(r311) [L327] COND TRUE \read(ep12) [L328] tmp___4 = 1 [L335] r322 = (_Bool )tmp___4 [L336] COND TRUE (int )id1 != (int )id2 [L337] COND TRUE (int )id1 != (int )id3 [L338] COND TRUE (int )id2 != (int )id3 [L339] COND TRUE (int )id1 >= 0 [L340] COND TRUE (int )id2 >= 0 [L341] COND TRUE (int )id3 >= 0 [L342] COND TRUE (int )r1 == 0 [L343] COND TRUE (int )r2 == 0 [L344] COND TRUE (int )r3 == 0 [L345] COND TRUE \read(r122) [L346] COND TRUE \read(r132) [L347] COND TRUE \read(r212) [L348] COND TRUE \read(r232) [L349] COND TRUE \read(r312) [L350] COND TRUE \read(r322) [L351] COND TRUE (int )max1 == (int )id1 [L352] COND TRUE (int )max2 == (int )id2 [L353] COND TRUE (int )max3 == (int )id3 [L354] COND TRUE (int )st1 == 0 [L355] COND TRUE (int )st2 == 0 [L356] COND TRUE (int )st3 == 0 [L357] COND TRUE (int )nl1 == 0 [L358] COND TRUE (int )nl2 == 0 [L359] COND TRUE (int )nl3 == 0 [L360] COND TRUE (int )mode1 == 0 [L361] COND TRUE (int )mode2 == 0 [L362] COND TRUE (int )mode3 == 0 [L363] COND TRUE \read(newmax1) [L364] COND TRUE \read(newmax2) [L365] COND TRUE \read(newmax3) [L366] tmp___5 = 1 [L457] return (tmp___5); [L553] RET, EXPR init() [L553] i2 = init() [L554] CALL assume_abort_if_not(i2) [L21] COND FALSE !(!cond) [L554] RET assume_abort_if_not(i2) [L555] p12_old = nomsg [L556] p12_new = nomsg [L557] p13_old = nomsg [L558] p13_new = nomsg [L559] p21_old = nomsg [L560] p21_new = nomsg [L561] p23_old = nomsg [L562] p23_new = nomsg [L563] p31_old = nomsg [L564] p31_new = nomsg [L565] p32_old = nomsg [L566] p32_new = nomsg [L567] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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] [L568] COND FALSE !(i2 < 6) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 1 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND FALSE !(\read(ep13)) [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND FALSE !(\read(ep21)) [L167] COND TRUE \read(ep23) [L168] COND TRUE \read(newmax2) [L169] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND TRUE \read(newmax3) [L215] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=1, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND FALSE !(i2 < 6) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=1, id1=1, id2=125, id3=126, m1=127, m2=0, m3=0, max1=1, max2=125, max3=126, 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=125, p31=0, p31_new=-1, p31_old=126, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND FALSE !(\read(ep21)) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND TRUE (int )m1 > (int )max1 [L96] max1 = m1 [L97] newmax = (_Bool)1 [L100] newmax1 = newmax [L101] COND FALSE !((int )r1 == 2) [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND FALSE !((int )r2 == 2) [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND FALSE !(\read(ep13)) [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND FALSE !((int )m3 > (int )max3) [L202] newmax3 = newmax [L203] COND FALSE !((int )r3 == 2) [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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 TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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 )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=2, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L568] COND FALSE !(i2 < 6) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=2, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, 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] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND FALSE !((int )r1 < 1) [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND FALSE !(\read(ep21)) [L167] COND TRUE \read(ep23) [L168] COND FALSE !(\read(newmax2)) [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND FALSE !(\read(newmax3)) [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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 TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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 )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=3, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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] [L568] COND FALSE !(i2 < 6) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=3, id1=1, id2=125, id3=126, m1=126, m2=1, m3=125, max1=126, max2=125, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, 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] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND FALSE !(\read(ep21)) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND FALSE !((int )m1 > (int )max1) [L100] newmax1 = newmax [L101] COND TRUE (int )r1 == 2 [L102] COND FALSE !((int )max1 == (int )id1) [L105] nl1 = (char)1 [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND TRUE (int )r2 == 2 [L153] COND TRUE (int )max2 == (int )id2 [L154] st2 = (char)1 [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND FALSE !(\read(ep13)) [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND FALSE !((int )m3 > (int )max3) [L202] newmax3 = newmax [L203] COND TRUE (int )r3 == 2 [L204] COND TRUE (int )max3 == (int )id3 [L205] st3 = (char)1 [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=-1, m2=-1, m3=-1, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=0, st2=1, st3=1] [L465] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L511] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=-1, m2=-1, m3=-1, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=0, st2=1, st3=1, tmp=0] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=-1, m2=-1, m3=-1, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=0, st2=1, st3=1] [L600] reach_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=125, id3=126, m1=-1, m2=-1, m3=-1, max1=126, max2=125, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 100.7MB. Free memory is still 57.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.67ms. Allocated memory is still 125.8MB. Free memory was 93.8MB in the beginning and 74.0MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.60ms. Allocated memory is still 125.8MB. Free memory was 74.0MB in the beginning and 70.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.60ms. Allocated memory is still 125.8MB. Free memory was 70.7MB in the beginning and 68.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1974.11ms. Allocated memory was 125.8MB in the beginning and 153.1MB in the end (delta: 27.3MB). Free memory was 67.8MB in the beginning and 87.0MB in the end (delta: -19.2MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. * CodeCheck took 218966.32ms. Allocated memory was 153.1MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 87.0MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 379.4MB. Max. memory is 16.1GB. * Witness Printer took 252.03ms. Allocated memory is still 2.4GB. Free memory was 2.0GB in the beginning and 1.9GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 19:42:56,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83583f08-78fc-48d8-adea-a4d8a8b33d3d/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE