./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 04:48:10,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 04:48:10,393 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 04:48:10,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 04:48:10,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 04:48:10,428 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 04:48:10,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 04:48:10,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 04:48:10,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 04:48:10,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 04:48:10,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 04:48:10,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 04:48:10,431 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 04:48:10,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 04:48:10,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 04:48:10,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 04:48:10,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 04:48:10,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 04:48:10,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 04:48:10,432 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 04:48:10,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 04:48:10,433 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 04:48:10,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 04:48:10,433 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 04:48:10,433 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 04:48:10,433 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 04:48:10,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 04:48:10,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:48:10,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 04:48:10,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 04:48:10,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 04:48:10,435 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 04:48:10,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 04:48:10,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec [2024-11-25 04:48:10,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 04:48:10,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 04:48:10,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 04:48:10,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 04:48:10,826 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 04:48:10,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-11-25 04:48:14,548 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/data/dd0b08cc7/f99142d6216642ba93c1cdd035a90317/FLAG8ee6b32e4 [2024-11-25 04:48:15,001 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 04:48:15,004 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-11-25 04:48:15,029 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/data/dd0b08cc7/f99142d6216642ba93c1cdd035a90317/FLAG8ee6b32e4 [2024-11-25 04:48:15,062 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/data/dd0b08cc7/f99142d6216642ba93c1cdd035a90317 [2024-11-25 04:48:15,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 04:48:15,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 04:48:15,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 04:48:15,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 04:48:15,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 04:48:15,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b53f15b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15, skipping insertion in model container [2024-11-25 04:48:15,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 04:48:15,603 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_90ee5df5-fa81-45ef-9199-e676fba12b58/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2024-11-25 04:48:15,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:48:15,630 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 04:48:15,748 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_90ee5df5-fa81-45ef-9199-e676fba12b58/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2024-11-25 04:48:15,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:48:15,775 INFO L204 MainTranslator]: Completed translation [2024-11-25 04:48:15,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15 WrapperNode [2024-11-25 04:48:15,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 04:48:15,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 04:48:15,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 04:48:15,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 04:48:15,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,843 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 483 [2024-11-25 04:48:15,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 04:48:15,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 04:48:15,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 04:48:15,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 04:48:15,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 04:48:15,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 04:48:15,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 04:48:15,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 04:48:15,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:48:15" (1/1) ... [2024-11-25 04:48:15,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:48:15,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 04:48:15,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 04:48:15,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 04:48:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 04:48:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 04:48:16,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 04:48:16,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 04:48:16,183 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 04:48:16,185 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 04:48:17,239 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-25 04:48:17,239 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 04:48:18,353 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 04:48:18,353 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 04:48:18,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:48:18 BoogieIcfgContainer [2024-11-25 04:48:18,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 04:48:18,357 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 04:48:18,357 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 04:48:18,372 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 04:48:18,372 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:48:18" (1/1) ... [2024-11-25 04:48:18,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 04:48:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-25 04:48:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-25 04:48:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 04:48:18,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:18,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:21,429 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-25 04:48:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-25 04:48:21,575 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-25 04:48:21,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 04:48:21,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:21,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:23,008 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-25 04:48:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-25 04:48:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-25 04:48:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 04:48:23,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:23,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:24,473 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-25 04:48:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-25 04:48:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-25 04:48:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 04:48:25,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:25,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:26,375 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-25 04:48:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-25 04:48:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-25 04:48:27,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 04:48:27,442 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:27,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:29,084 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-25 04:48:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-11-25 04:48:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-11-25 04:48:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 04:48:30,462 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:30,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:31,608 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-25 04:48:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-11-25 04:48:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-11-25 04:48:33,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 04:48:33,152 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:33,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:33,344 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-25 04:48:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-11-25 04:48:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-11-25 04:48:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:48:33,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:33,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:35,348 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-25 04:48:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 56 states and 97 transitions. [2024-11-25 04:48:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 97 transitions. [2024-11-25 04:48:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 04:48:38,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:38,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:38,235 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-25 04:48:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 57 states and 98 transitions. [2024-11-25 04:48:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions. [2024-11-25 04:48:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 04:48:38,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:38,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:38,999 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-25 04:48:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 60 states and 104 transitions. [2024-11-25 04:48:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 104 transitions. [2024-11-25 04:48:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-25 04:48:39,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:39,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:48:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 76 states and 133 transitions. [2024-11-25 04:48:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 133 transitions. [2024-11-25 04:48:48,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 04:48:48,679 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:50,548 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-25 04:48:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 90 states and 165 transitions. [2024-11-25 04:48:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 165 transitions. [2024-11-25 04:48:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 04:48:54,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:54,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:48:56,078 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-25 04:48:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:48:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 104 states and 197 transitions. [2024-11-25 04:48:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 197 transitions. [2024-11-25 04:48:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 04:48:59,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:48:59,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:48:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:02,027 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-25 04:49:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 116 states and 229 transitions. [2024-11-25 04:49:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 229 transitions. [2024-11-25 04:49:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 04:49:06,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:06,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 117 states and 233 transitions. [2024-11-25 04:49:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 233 transitions. [2024-11-25 04:49:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 04:49:07,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:07,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:09,397 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-25 04:49:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 131 states and 264 transitions. [2024-11-25 04:49:14,664 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 264 transitions. [2024-11-25 04:49:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 04:49:14,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:14,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:15,786 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-25 04:49:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 132 states and 267 transitions. [2024-11-25 04:49:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 267 transitions. [2024-11-25 04:49:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 04:49:16,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:16,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:18,198 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-25 04:49:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 136 states and 282 transitions. [2024-11-25 04:49:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 282 transitions. [2024-11-25 04:49:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 04:49:21,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:21,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:22,281 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-25 04:49:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 138 states and 288 transitions. [2024-11-25 04:49:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 288 transitions. [2024-11-25 04:49:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 04:49:23,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:23,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 158 states and 328 transitions. [2024-11-25 04:49:34,112 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 328 transitions. [2024-11-25 04:49:34,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 04:49:34,113 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:34,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 163 states and 340 transitions. [2024-11-25 04:49:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 340 transitions. [2024-11-25 04:49:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 04:49:38,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:38,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:44,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 168 states and 351 transitions. [2024-11-25 04:49:44,849 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 351 transitions. [2024-11-25 04:49:44,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 04:49:44,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:49:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:49:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:49:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 182 states and 400 transitions. [2024-11-25 04:49:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 400 transitions. [2024-11-25 04:49:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-25 04:49:56,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:49:56,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:49:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:50:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:12,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 195 states and 439 transitions. [2024-11-25 04:50:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 439 transitions. [2024-11-25 04:50:12,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-25 04:50:12,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:12,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:50:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:25,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 206 states and 455 transitions. [2024-11-25 04:50:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 455 transitions. [2024-11-25 04:50:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-25 04:50:25,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:25,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:50:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 210 states and 474 transitions. [2024-11-25 04:50:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 474 transitions. [2024-11-25 04:50:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 04:50:32,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:32,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:50:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 225 states and 511 transitions. [2024-11-25 04:50:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 511 transitions. [2024-11-25 04:50:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 04:50:46,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:46,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:50:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:50:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 229 states and 531 transitions. [2024-11-25 04:50:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 531 transitions. [2024-11-25 04:50:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 04:50:50,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:50:50,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:50:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:50:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:51:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 241 states and 562 transitions. [2024-11-25 04:51:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 562 transitions. [2024-11-25 04:51:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 04:51:06,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:06,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:51:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 243 states and 566 transitions. [2024-11-25 04:51:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 566 transitions. [2024-11-25 04:51:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 04:51:17,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:51:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 245 states and 571 transitions. [2024-11-25 04:51:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 571 transitions. [2024-11-25 04:51:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 04:51:24,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:24,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:51:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 247 states and 586 transitions. [2024-11-25 04:51:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 586 transitions. [2024-11-25 04:51:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 04:51:32,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:32,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:51:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:51:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 262 states and 645 transitions. [2024-11-25 04:51:53,945 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 645 transitions. [2024-11-25 04:51:53,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 04:51:53,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:51:53,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:51:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:51:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:52:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 271 states and 662 transitions. [2024-11-25 04:52:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 662 transitions. [2024-11-25 04:52:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-25 04:52:03,385 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:03,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:52:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 275 states and 679 transitions. [2024-11-25 04:52:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 679 transitions. [2024-11-25 04:52:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:52:12,830 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:12,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:52:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 287 states and 713 transitions. [2024-11-25 04:52:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 713 transitions. [2024-11-25 04:52:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:52:31,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-25 04:52:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 288 states and 714 transitions. [2024-11-25 04:52:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 714 transitions. [2024-11-25 04:52:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:52:32,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:32,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:52:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 294 states and 745 transitions. [2024-11-25 04:52:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 745 transitions. [2024-11-25 04:52:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:52:46,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:46,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:52:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:52:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:52:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 298 states and 767 transitions. [2024-11-25 04:52:55,710 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 767 transitions. [2024-11-25 04:52:55,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:52:55,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:52:55,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:52:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:53:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:53:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:53:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 301 states and 779 transitions. [2024-11-25 04:53:08,185 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 779 transitions. [2024-11-25 04:53:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:53:08,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:53:08,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:53:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:53:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:53:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:53:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 304 states and 789 transitions. [2024-11-25 04:53:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 789 transitions. [2024-11-25 04:53:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-25 04:53:16,775 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:53:16,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:53:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:53:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-25 04:53:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:53:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 304 states and 788 transitions. [2024-11-25 04:53:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 788 transitions. [2024-11-25 04:53:17,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-25 04:53:17,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:53:17,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:53:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:53:18,988 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 04:53:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:53:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:53:20,992 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 04:53:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:53:21,757 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 43 iterations. [2024-11-25 04:53:21,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 04:53:21 ImpRootNode [2024-11-25 04:53:21,961 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 04:53:21,962 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 04:53:21,962 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 04:53:21,962 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 04:53:21,963 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:48:18" (3/4) ... [2024-11-25 04:53:21,966 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-25 04:53:22,201 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 177. [2024-11-25 04:53:22,638 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 04:53:22,643 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 04:53:22,643 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 04:53:22,644 INFO L158 Benchmark]: Toolchain (without parser) took 307576.01ms. Allocated memory was 117.4MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 93.6MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-25 04:53:22,645 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:53:22,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 704.60ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 75.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 04:53:22,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.32ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 72.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:53:22,646 INFO L158 Benchmark]: Boogie Preprocessor took 80.34ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 70.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 04:53:22,646 INFO L158 Benchmark]: RCFGBuilder took 2429.76ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 70.0MB in the beginning and 228.6MB in the end (delta: -158.6MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2024-11-25 04:53:22,652 INFO L158 Benchmark]: CodeCheck took 303604.04ms. Allocated memory was 352.3MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 228.6MB in the beginning and 734.9MB in the end (delta: -506.3MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-25 04:53:22,653 INFO L158 Benchmark]: Witness Printer took 681.51ms. Allocated memory is still 2.1GB. Free memory was 734.9MB in the beginning and 1.9GB in the end (delta: -1.1GB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2024-11-25 04:53:22,656 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 303.4s, OverallIterations: 43, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14470 SdHoareTripleChecker+Valid, 144.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13007 mSDsluCounter, 5353 SdHoareTripleChecker+Invalid, 129.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4572 mSDsCounter, 5442 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44111 IncrementalHoareTripleChecker+Invalid, 49553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5442 mSolverCounterUnsat, 781 mSDtfsCounter, 44111 mSolverCounterSat, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12511 GetRequests, 10875 SyntacticMatches, 614 SemanticMatches, 1022 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679867 ImplicationChecksByTransitivity, 224.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 86.1s InterpolantComputationTime, 1219 NumberOfCodeBlocks, 1219 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1129 ConstructedInterpolants, 0 QuantifiedInterpolants, 10516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 12 PerfectInterpolantSequences, 192/727 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 585]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L504] int c1 ; [L505] int i2 ; [L508] c1 = 0 [L509] ep12 = __VERIFIER_nondet_bool() [L510] ep13 = __VERIFIER_nondet_bool() [L511] ep21 = __VERIFIER_nondet_bool() [L512] ep23 = __VERIFIER_nondet_bool() [L513] ep31 = __VERIFIER_nondet_bool() [L514] ep32 = __VERIFIER_nondet_bool() [L515] id1 = __VERIFIER_nondet_char() [L516] r1 = __VERIFIER_nondet_uchar() [L517] st1 = __VERIFIER_nondet_char() [L518] nl1 = __VERIFIER_nondet_char() [L519] m1 = __VERIFIER_nondet_char() [L520] max1 = __VERIFIER_nondet_char() [L521] mode1 = __VERIFIER_nondet_bool() [L522] newmax1 = __VERIFIER_nondet_bool() [L523] id2 = __VERIFIER_nondet_char() [L524] r2 = __VERIFIER_nondet_uchar() [L525] st2 = __VERIFIER_nondet_char() [L526] nl2 = __VERIFIER_nondet_char() [L527] m2 = __VERIFIER_nondet_char() [L528] max2 = __VERIFIER_nondet_char() [L529] mode2 = __VERIFIER_nondet_bool() [L530] newmax2 = __VERIFIER_nondet_bool() [L531] id3 = __VERIFIER_nondet_char() [L532] r3 = __VERIFIER_nondet_uchar() [L533] st3 = __VERIFIER_nondet_char() [L534] nl3 = __VERIFIER_nondet_char() [L535] m3 = __VERIFIER_nondet_char() [L536] max3 = __VERIFIER_nondet_char() [L537] mode3 = __VERIFIER_nondet_bool() [L538] newmax3 = __VERIFIER_nondet_bool() [L539] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND FALSE !(\read(r121)) [L271] COND FALSE !(\read(r131)) [L278] tmp = 0 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND FALSE !(\read(r121)) [L291] tmp___0 = 0 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND TRUE \read(r231) [L298] COND FALSE !(\read(ep31)) [L301] tmp___1 = 0 [L306] r212 = (_Bool )tmp___1 [L307] COND TRUE \read(r231) [L308] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND FALSE !(\read(r321)) [L330] tmp___3 = 0 [L332] r312 = (_Bool )tmp___3 [L333] COND FALSE !(\read(r321)) [L336] COND FALSE !(\read(r311)) [L343] tmp___4 = 0 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE (int )max1 == (int )id1 [L356] COND TRUE (int )max2 == (int )id2 [L357] COND TRUE (int )max3 == (int )id3 [L358] COND TRUE (int )st1 == 0 [L359] COND TRUE (int )st2 == 0 [L360] COND TRUE (int )st3 == 0 [L361] COND TRUE (int )nl1 == 0 [L362] COND TRUE (int )nl2 == 0 [L363] COND TRUE (int )nl3 == 0 [L364] COND TRUE (int )mode1 == 0 [L365] COND TRUE (int )mode2 == 0 [L366] COND TRUE (int )mode3 == 0 [L367] COND TRUE \read(newmax1) [L368] COND TRUE \read(newmax2) [L369] COND TRUE \read(newmax3) [L370] tmp___5 = 1 [L443] return (tmp___5); [L539] RET, EXPR init() [L539] i2 = init() [L540] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L540] RET assume_abort_if_not(i2) [L541] p12_old = nomsg [L542] p12_new = nomsg [L543] p13_old = nomsg [L544] p13_new = nomsg [L545] p21_old = nomsg [L546] p21_new = nomsg [L547] p23_old = nomsg [L548] p23_new = nomsg [L549] p31_old = nomsg [L550] p31_new = nomsg [L551] p32_old = nomsg [L552] p32_new = nomsg [L553] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=127, max1=1, max2=2, max3=0, 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=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=127, max1=1, max2=2, max3=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=127, max1=1, max2=2, max3=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=127, max1=1, max2=2, max3=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=127, max1=1, max2=2, max3=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=127, max1=1, max2=2, max3=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=127, max1=1, max2=2, max3=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=127, max1=1, max2=2, max3=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=127, max1=1, max2=2, max3=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=127, max1=1, max2=2, max3=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=127, max1=1, max2=2, max3=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=127, max1=1, max2=2, max3=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=127, max1=1, max2=2, max3=0, 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=2, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L572] RET assert(c1) [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND TRUE (int )m3 > (int )max3 [L208] max3 = m3 [L209] newmax = (_Bool)1 [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L572] RET assert(c1) [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND FALSE !(\read(newmax2)) [L180] mode2 = (_Bool)1 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=2, max1=1, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, 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=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L572] RET assert(c1) [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND TRUE (int )max1 == (int )id1 [L107] st1 = (char)1 [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (char)1 [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND FALSE !((int )max3 == (int )id3) [L217] nl3 = (char)1 [L220] mode3 = (_Bool)0 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=-1, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L451] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L497] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=-1, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0, tmp=0] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=-1, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L585] reach_error() VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=3, m2=0, m3=-1, max1=1, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 704.60ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 75.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.32ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 72.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.34ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 70.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2429.76ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 70.0MB in the beginning and 228.6MB in the end (delta: -158.6MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. * CodeCheck took 303604.04ms. Allocated memory was 352.3MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 228.6MB in the beginning and 734.9MB in the end (delta: -506.3MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 681.51ms. Allocated memory is still 2.1GB. Free memory was 734.9MB in the beginning and 1.9GB in the end (delta: -1.1GB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-25 04:53:22,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90ee5df5-fa81-45ef-9199-e676fba12b58/bin/ukojak-verify-ENZ3QT5qd3/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