./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:24:46,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:24:46,218 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 19:24:46,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:24:46,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 19:24:46,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:24:46,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:24:46,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 19:24:46,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:24:46,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:24:46,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:24:46,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:24:46,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:24:46,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:24:46,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:24:46,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:24:46,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:24:46,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:24:46,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:24:46,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:24:46,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:24:46,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:24:46,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:24:46,292 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 19:24:46,293 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 19:24:46,293 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 19:24:46,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:24:46,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:24:46,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:24:46,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:24:46,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:24:46,298 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 19:24:46,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:24:46,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce [2024-11-08 19:24:46,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:24:46,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:24:46,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:24:46,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:24:46,716 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:24:46,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-08 19:24:49,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:24:49,545 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:24:49,545 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2024-11-08 19:24:49,562 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/data/189cd06df/3c47637d6d634ccfa00a8939ec1ac4b9/FLAG2b6edfd4b [2024-11-08 19:24:49,582 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/data/189cd06df/3c47637d6d634ccfa00a8939ec1ac4b9 [2024-11-08 19:24:49,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:24:49,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:24:49,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:24:49,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:24:49,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:24:49,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:24:49" (1/1) ... [2024-11-08 19:24:49,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed6af0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:49, skipping insertion in model container [2024-11-08 19:24:49,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:24:49" (1/1) ... [2024-11-08 19:24:49,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:24:50,062 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_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2024-11-08 19:24:50,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:24:50,083 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:24:50,178 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_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2024-11-08 19:24:50,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:24:50,207 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:24:50,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:50 WrapperNode [2024-11-08 19:24:50,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:24:50,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:24:50,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:24:50,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:24:50,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:50" (1/1) ... [2024-11-08 19:24:50,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:50" (1/1) ... [2024-11-08 19:24:50,304 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2024-11-08 19:24:50,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:24:50,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:24:50,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:24:50,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:24:50,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:50" (1/1) ... [2024-11-08 19:24:50,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:50" (1/1) ... [2024-11-08 19:24:50,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:50" (1/1) ... [2024-11-08 19:24:50,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:50" (1/1) ... [2024-11-08 19:24:50,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:50" (1/1) ... [2024-11-08 19:24:50,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:50" (1/1) ... [2024-11-08 19:24:50,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:50" (1/1) ... [2024-11-08 19:24:50,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:50" (1/1) ... [2024-11-08 19:24:50,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:24:50,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:24:50,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:24:50,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:24:50,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:50" (1/1) ... [2024-11-08 19:24:50,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:24:50,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 19:24:50,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 19:24:50,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 19:24:50,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:24:50,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 19:24:50,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:24:50,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:24:50,677 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:24:50,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:24:51,606 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-08 19:24:51,609 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:24:52,614 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:24:52,614 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:24:52,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:24:52 BoogieIcfgContainer [2024-11-08 19:24:52,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:24:52,616 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 19:24:52,617 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 19:24:52,631 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 19:24:52,631 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:24:52" (1/1) ... [2024-11-08 19:24:52,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:24:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2024-11-08 19:24:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2024-11-08 19:24:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 19:24:52,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:24:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:24:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 24 states and 39 transitions. [2024-11-08 19:24:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2024-11-08 19:24:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:24:56,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:24:56,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:24:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 28 states and 48 transitions. [2024-11-08 19:24:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2024-11-08 19:24:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 19:24:57,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:24:57,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:00,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 33 states and 59 transitions. [2024-11-08 19:25:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2024-11-08 19:25:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 19:25:00,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:00,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 39 states and 72 transitions. [2024-11-08 19:25:02,293 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 72 transitions. [2024-11-08 19:25:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:25:02,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:02,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 47 states and 87 transitions. [2024-11-08 19:25:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 87 transitions. [2024-11-08 19:25:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 19:25:05,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:05,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 54 states and 101 transitions. [2024-11-08 19:25:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 101 transitions. [2024-11-08 19:25:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:25:07,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:07,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:07,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 55 states and 101 transitions. [2024-11-08 19:25:07,880 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 101 transitions. [2024-11-08 19:25:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:25:07,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:07,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:08,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 56 states and 102 transitions. [2024-11-08 19:25:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 102 transitions. [2024-11-08 19:25:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:25:08,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:08,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 67 states and 121 transitions. [2024-11-08 19:25:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 121 transitions. [2024-11-08 19:25:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 19:25:11,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:11,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 70 states and 126 transitions. [2024-11-08 19:25:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 126 transitions. [2024-11-08 19:25:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:25:12,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:12,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:21,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 88 states and 165 transitions. [2024-11-08 19:25:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 165 transitions. [2024-11-08 19:25:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:25:21,878 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:21,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 107 states and 207 transitions. [2024-11-08 19:25:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 207 transitions. [2024-11-08 19:25:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:25:31,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:31,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 108 states and 208 transitions. [2024-11-08 19:25:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 208 transitions. [2024-11-08 19:25:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:25:33,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:33,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 128 states and 251 transitions. [2024-11-08 19:25:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 251 transitions. [2024-11-08 19:25:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:25:44,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:44,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 129 states and 254 transitions. [2024-11-08 19:25:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 254 transitions. [2024-11-08 19:25:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:25:46,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:46,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 130 states and 255 transitions. [2024-11-08 19:25:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 255 transitions. [2024-11-08 19:25:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:25:48,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:25:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:25:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 145 states and 298 transitions. [2024-11-08 19:25:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 298 transitions. [2024-11-08 19:25:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:25:59,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:25:59,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:25:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:26:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 147 states and 302 transitions. [2024-11-08 19:26:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 302 transitions. [2024-11-08 19:26:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:26:02,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:26:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:05,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 150 states and 311 transitions. [2024-11-08 19:26:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 311 transitions. [2024-11-08 19:26:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:26:05,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:26:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 151 states and 312 transitions. [2024-11-08 19:26:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 312 transitions. [2024-11-08 19:26:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:26:07,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:26:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 152 states and 313 transitions. [2024-11-08 19:26:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 313 transitions. [2024-11-08 19:26:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:26:10,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:10,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:26:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 172 states and 357 transitions. [2024-11-08 19:26:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 357 transitions. [2024-11-08 19:26:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:26:23,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:26:34,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 189 states and 387 transitions. [2024-11-08 19:26:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 387 transitions. [2024-11-08 19:26:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:26:34,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:34,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:26:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 191 states and 392 transitions. [2024-11-08 19:26:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 392 transitions. [2024-11-08 19:26:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:26:38,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:38,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:26:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 193 states and 396 transitions. [2024-11-08 19:26:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 396 transitions. [2024-11-08 19:26:43,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:26:43,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:43,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:26:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 195 states and 398 transitions. [2024-11-08 19:26:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 398 transitions. [2024-11-08 19:26:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:26:47,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:47,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:26:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 196 states and 399 transitions. [2024-11-08 19:26:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 399 transitions. [2024-11-08 19:26:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:26:50,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:50,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:53,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:26:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 197 states and 399 transitions. [2024-11-08 19:26:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 399 transitions. [2024-11-08 19:26:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:26:54,352 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:54,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:26:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:26:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 198 states and 402 transitions. [2024-11-08 19:26:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 402 transitions. [2024-11-08 19:26:58,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 19:26:58,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:26:58,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:26:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:26:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:27:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:27:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 215 states and 430 transitions. [2024-11-08 19:27:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 430 transitions. [2024-11-08 19:27:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 19:27:07,428 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:27:07,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:27:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:27:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:27:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:27:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 220 states and 447 transitions. [2024-11-08 19:27:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 447 transitions. [2024-11-08 19:27:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:27:11,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:27:11,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:27:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:27:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:27:19,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:27:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 224 states and 455 transitions. [2024-11-08 19:27:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 455 transitions. [2024-11-08 19:27:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 19:27:19,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:27:19,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:27:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:27:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:27:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:27:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 244 states and 491 transitions. [2024-11-08 19:27:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 491 transitions. [2024-11-08 19:27:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 19:27:32,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:27:32,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:27:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:27:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:27:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:27:52,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 259 states and 554 transitions. [2024-11-08 19:27:52,524 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 554 transitions. [2024-11-08 19:27:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 19:27:52,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:27:52,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:27:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:27:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 274 states and 610 transitions. [2024-11-08 19:28:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 610 transitions. [2024-11-08 19:28:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:28:12,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:12,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:28:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 286 states and 632 transitions. [2024-11-08 19:28:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 632 transitions. [2024-11-08 19:28:27,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:28:27,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:27,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 19:28:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:28:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 299 states and 671 transitions. [2024-11-08 19:28:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 671 transitions. [2024-11-08 19:28:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:28:40,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:28:40,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:28:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:28:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 327 states and 723 transitions. [2024-11-08 19:29:07,907 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 723 transitions. [2024-11-08 19:29:07,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 19:29:07,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:07,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 335 states and 742 transitions. [2024-11-08 19:29:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 742 transitions. [2024-11-08 19:29:27,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 19:29:27,258 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:29:45,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:29:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 347 states and 774 transitions. [2024-11-08 19:29:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 774 transitions. [2024-11-08 19:29:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 19:29:45,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:29:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:29:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:29:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:30:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 357 states and 797 transitions. [2024-11-08 19:30:03,516 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 797 transitions. [2024-11-08 19:30:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 19:30:03,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:03,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:30:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 365 states and 815 transitions. [2024-11-08 19:30:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 815 transitions. [2024-11-08 19:30:15,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 19:30:15,332 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:15,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:30:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 367 states and 819 transitions. [2024-11-08 19:30:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 819 transitions. [2024-11-08 19:30:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:30:21,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:21,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:30:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 378 states and 849 transitions. [2024-11-08 19:30:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 849 transitions. [2024-11-08 19:30:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:30:40,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:30:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:30:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 386 states and 873 transitions. [2024-11-08 19:30:48,566 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 873 transitions. [2024-11-08 19:30:48,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:30:48,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:30:48,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:30:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:30:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 394 states and 886 transitions. [2024-11-08 19:31:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 886 transitions. [2024-11-08 19:31:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:31:00,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 398 states and 902 transitions. [2024-11-08 19:31:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 902 transitions. [2024-11-08 19:31:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:31:17,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 401 states and 909 transitions. [2024-11-08 19:31:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 909 transitions. [2024-11-08 19:31:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:31:32,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:32,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 404 states and 924 transitions. [2024-11-08 19:31:38,813 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 924 transitions. [2024-11-08 19:31:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:31:38,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:38,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 407 states and 939 transitions. [2024-11-08 19:31:44,953 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 939 transitions. [2024-11-08 19:31:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 19:31:44,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:44,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 412 states and 958 transitions. [2024-11-08 19:31:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 958 transitions. [2024-11-08 19:31:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 19:31:53,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:53,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:32:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 421 states and 985 transitions. [2024-11-08 19:32:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 985 transitions. [2024-11-08 19:32:07,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 19:32:07,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:07,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:32:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 423 states and 988 transitions. [2024-11-08 19:32:13,170 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 988 transitions. [2024-11-08 19:32:13,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 19:32:13,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:13,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:32:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 428 states and 1006 transitions. [2024-11-08 19:32:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1006 transitions. [2024-11-08 19:32:21,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 19:32:21,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:21,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:32:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 430 states and 1012 transitions. [2024-11-08 19:32:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1012 transitions. [2024-11-08 19:32:30,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 19:32:30,818 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:32:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 438 states and 1040 transitions. [2024-11-08 19:32:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1040 transitions. [2024-11-08 19:32:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 19:32:47,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:47,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:33:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 441 states and 1045 transitions. [2024-11-08 19:33:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1045 transitions. [2024-11-08 19:33:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 19:33:00,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:00,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:33:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 447 states and 1065 transitions. [2024-11-08 19:33:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1065 transitions. [2024-11-08 19:33:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 19:33:11,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:11,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:33:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 452 states and 1083 transitions. [2024-11-08 19:33:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1083 transitions. [2024-11-08 19:33:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 19:33:20,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:20,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:33:22,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:33:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:33:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:33:24,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:33:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:33:24,973 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 60 iterations. [2024-11-08 19:33:25,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 07:33:25 ImpRootNode [2024-11-08 19:33:25,161 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 19:33:25,162 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:33:25,162 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:33:25,163 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:33:25,163 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:24:52" (3/4) ... [2024-11-08 19:33:25,165 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 19:33:25,422 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 19:33:25,422 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:33:25,423 INFO L158 Benchmark]: Toolchain (without parser) took 515835.11ms. Allocated memory was 172.0MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 130.0MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 453.2MB. Max. memory is 16.1GB. [2024-11-08 19:33:25,423 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 172.0MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:33:25,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.95ms. Allocated memory is still 172.0MB. Free memory was 130.0MB in the beginning and 110.0MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 19:33:25,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.89ms. Allocated memory is still 172.0MB. Free memory was 110.0MB in the beginning and 107.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:33:25,424 INFO L158 Benchmark]: Boogie Preprocessor took 56.74ms. Allocated memory is still 172.0MB. Free memory was 107.0MB in the beginning and 104.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:33:25,425 INFO L158 Benchmark]: RCFGBuilder took 2248.52ms. Allocated memory was 172.0MB in the beginning and 209.7MB in the end (delta: 37.7MB). Free memory was 104.3MB in the beginning and 108.9MB in the end (delta: -4.6MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2024-11-08 19:33:25,425 INFO L158 Benchmark]: CodeCheck took 512545.07ms. Allocated memory was 209.7MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 108.9MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 372.3MB. Max. memory is 16.1GB. [2024-11-08 19:33:25,426 INFO L158 Benchmark]: Witness Printer took 259.94ms. Allocated memory is still 5.3GB. Free memory was 4.9GB in the beginning and 4.8GB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 19:33:25,428 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 512.3s, OverallIterations: 60, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30184 SdHoareTripleChecker+Valid, 267.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28184 mSDsluCounter, 19039 SdHoareTripleChecker+Invalid, 241.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13364 mSDsCounter, 8987 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78465 IncrementalHoareTripleChecker+Invalid, 87452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8987 mSolverCounterUnsat, 5675 mSDtfsCounter, 78465 mSolverCounterSat, 2.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20285 GetRequests, 18124 SyntacticMatches, 825 SemanticMatches, 1336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057831 ImplicationChecksByTransitivity, 381.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 141.5s InterpolantComputationTime, 1835 NumberOfCodeBlocks, 1835 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1724 ConstructedInterpolants, 0 QuantifiedInterpolants, 19115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 59 InterpolantComputations, 10 PerfectInterpolantSequences, 208/1056 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 573]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] _Bool newmax1 ; [L57] char id2 ; [L58] char r2 ; [L59] char st2 ; [L60] char nl2 ; [L61] char m2 ; [L62] char max2 ; [L63] _Bool mode2 ; [L64] _Bool newmax2 ; [L65] char id3 ; [L66] char r3 ; [L67] char st3 ; [L68] char nl3 ; [L69] char m3 ; [L70] char max3 ; [L71] _Bool mode3 ; [L72] _Bool newmax3 ; [L491] int c1 ; [L492] int i2 ; [L495] c1 = 0 [L496] ep12 = __VERIFIER_nondet_bool() [L497] ep13 = __VERIFIER_nondet_bool() [L498] ep21 = __VERIFIER_nondet_bool() [L499] ep23 = __VERIFIER_nondet_bool() [L500] ep31 = __VERIFIER_nondet_bool() [L501] ep32 = __VERIFIER_nondet_bool() [L502] id1 = __VERIFIER_nondet_char() [L503] r1 = __VERIFIER_nondet_char() [L504] st1 = __VERIFIER_nondet_char() [L505] nl1 = __VERIFIER_nondet_char() [L506] m1 = __VERIFIER_nondet_char() [L507] max1 = __VERIFIER_nondet_char() [L508] mode1 = __VERIFIER_nondet_bool() [L509] newmax1 = __VERIFIER_nondet_bool() [L510] id2 = __VERIFIER_nondet_char() [L511] r2 = __VERIFIER_nondet_char() [L512] st2 = __VERIFIER_nondet_char() [L513] nl2 = __VERIFIER_nondet_char() [L514] m2 = __VERIFIER_nondet_char() [L515] max2 = __VERIFIER_nondet_char() [L516] mode2 = __VERIFIER_nondet_bool() [L517] newmax2 = __VERIFIER_nondet_bool() [L518] id3 = __VERIFIER_nondet_char() [L519] r3 = __VERIFIER_nondet_char() [L520] st3 = __VERIFIER_nondet_char() [L521] nl3 = __VERIFIER_nondet_char() [L522] m3 = __VERIFIER_nondet_char() [L523] max3 = __VERIFIER_nondet_char() [L524] mode3 = __VERIFIER_nondet_bool() [L525] newmax3 = __VERIFIER_nondet_bool() [L526] CALL, EXPR init() [L228] _Bool r121 ; [L229] _Bool r131 ; [L230] _Bool r211 ; [L231] _Bool r231 ; [L232] _Bool r311 ; [L233] _Bool r321 ; [L234] _Bool r122 ; [L235] int tmp ; [L236] _Bool r132 ; [L237] int tmp___0 ; [L238] _Bool r212 ; [L239] int tmp___1 ; [L240] _Bool r232 ; [L241] int tmp___2 ; [L242] _Bool r312 ; [L243] int tmp___3 ; [L244] _Bool r322 ; [L245] int tmp___4 ; [L246] int tmp___5 ; [L249] r121 = ep12 [L250] r131 = ep13 [L251] r211 = ep21 [L252] r231 = ep23 [L253] r311 = ep31 [L254] r321 = ep32 [L255] COND FALSE !(\read(r121)) [L258] COND FALSE !(\read(r131)) [L265] tmp = 0 [L267] r122 = (_Bool )tmp [L268] COND FALSE !(\read(r131)) [L271] COND FALSE !(\read(r121)) [L278] tmp___0 = 0 [L280] r132 = (_Bool )tmp___0 [L281] COND FALSE !(\read(r211)) [L284] COND TRUE \read(r231) [L285] COND FALSE !(\read(ep31)) [L288] tmp___1 = 0 [L293] r212 = (_Bool )tmp___1 [L294] COND TRUE \read(r231) [L295] tmp___2 = 1 [L306] r232 = (_Bool )tmp___2 [L307] COND FALSE !(\read(r311)) [L310] COND FALSE !(\read(r321)) [L317] tmp___3 = 0 [L319] r312 = (_Bool )tmp___3 [L320] COND FALSE !(\read(r321)) [L323] COND FALSE !(\read(r311)) [L330] tmp___4 = 0 [L332] r322 = (_Bool )tmp___4 [L333] COND TRUE (int )id1 != (int )id2 [L334] COND TRUE (int )id1 != (int )id3 [L335] COND TRUE (int )id2 != (int )id3 [L336] COND TRUE (int )id1 >= 0 [L337] COND TRUE (int )id2 >= 0 [L338] COND TRUE (int )id3 >= 0 [L339] COND TRUE (int )r1 == 0 [L340] COND TRUE (int )r2 == 0 [L341] COND TRUE (int )r3 == 0 [L342] COND TRUE (int )max1 == (int )id1 [L343] COND TRUE (int )max2 == (int )id2 [L344] COND TRUE (int )max3 == (int )id3 [L345] COND TRUE (int )st1 == 0 [L346] COND TRUE (int )st2 == 0 [L347] COND TRUE (int )st3 == 0 [L348] COND TRUE (int )nl1 == 0 [L349] COND TRUE (int )nl2 == 0 [L350] COND TRUE (int )nl3 == 0 [L351] COND TRUE (int )mode1 == 0 [L352] COND TRUE (int )mode2 == 0 [L353] COND TRUE (int )mode3 == 0 [L354] COND TRUE \read(newmax1) [L355] COND TRUE \read(newmax2) [L356] COND TRUE \read(newmax3) [L357] tmp___5 = 1 [L430] return (tmp___5); [L526] RET, EXPR init() [L526] i2 = init() [L527] COND FALSE !(!(i2)) [L528] p12_old = nomsg [L529] p12_new = nomsg [L530] p13_old = nomsg [L531] p13_new = nomsg [L532] p21_old = nomsg [L533] p21_new = nomsg [L534] p23_old = nomsg [L535] p23_new = nomsg [L536] p31_old = nomsg [L537] p31_new = nomsg [L538] p32_old = nomsg [L539] p32_new = nomsg [L540] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] COND FALSE !(i2 < 6) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L113] COND FALSE !(\read(ep13)) [L119] mode1 = (_Bool)1 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND FALSE !(\read(mode2)) [L158] COND TRUE (int )r2 < 2 [L159] COND FALSE !(\read(ep21)) [L164] COND TRUE \read(ep23) [L165] COND TRUE \read(newmax2) [L166] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L170] mode2 = (_Bool)1 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND FALSE !(\read(mode3)) [L209] COND TRUE (int )r3 < 2 [L210] COND FALSE !(\read(ep31)) [L215] COND FALSE !(\read(ep32)) [L221] mode3 = (_Bool)1 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=1, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] COND FALSE !(i2 < 6) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=1, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-128, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND TRUE \read(mode1) [L80] r1 = (char )((int )r1 + 1) [L81] COND FALSE !(\read(ep21)) [L89] COND FALSE !(\read(ep31)) [L97] newmax1 = newmax [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND TRUE \read(mode2) [L131] r2 = (char )((int )r2 + 1) [L132] COND FALSE !(\read(ep12)) [L140] COND FALSE !(\read(ep32)) [L148] newmax2 = newmax [L149] COND FALSE !((int )r2 == 2) [L156] mode2 = (_Bool)0 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND TRUE \read(mode3) [L182] r3 = (char )((int )r3 + 1) [L183] COND FALSE !(\read(ep13)) [L191] COND TRUE \read(ep23) [L192] m3 = p23_old [L193] p23_old = nomsg [L194] COND FALSE !((int )m3 > (int )max3) [L199] newmax3 = newmax [L200] COND FALSE !((int )r3 == 2) [L207] mode3 = (_Bool)0 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=2, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] COND FALSE !(i2 < 6) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=2, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L113] COND FALSE !(\read(ep13)) [L119] mode1 = (_Bool)1 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND FALSE !(\read(mode2)) [L158] COND TRUE (int )r2 < 2 [L159] COND FALSE !(\read(ep21)) [L164] COND TRUE \read(ep23) [L165] COND FALSE !(\read(newmax2)) [L170] mode2 = (_Bool)1 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND FALSE !(\read(mode3)) [L209] COND TRUE (int )r3 < 2 [L210] COND FALSE !(\read(ep31)) [L215] COND FALSE !(\read(ep32)) [L221] mode3 = (_Bool)1 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=3, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] COND FALSE !(i2 < 6) VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, i2=3, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=0, max1=127, max2=0, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND TRUE \read(mode1) [L80] r1 = (char )((int )r1 + 1) [L81] COND FALSE !(\read(ep21)) [L89] COND FALSE !(\read(ep31)) [L97] newmax1 = newmax [L98] COND TRUE (int )r1 == 2 [L99] COND TRUE (int )max1 == (int )id1 [L100] st1 = (char)1 [L105] mode1 = (_Bool)0 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND TRUE \read(mode2) [L131] r2 = (char )((int )r2 + 1) [L132] COND FALSE !(\read(ep12)) [L140] COND FALSE !(\read(ep32)) [L148] newmax2 = newmax [L149] COND TRUE (int )r2 == 2 [L150] COND TRUE (int )max2 == (int )id2 [L151] st2 = (char)1 [L156] mode2 = (_Bool)0 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND TRUE \read(mode3) [L182] r3 = (char )((int )r3 + 1) [L183] COND FALSE !(\read(ep13)) [L191] COND TRUE \read(ep23) [L192] m3 = p23_old [L193] p23_old = nomsg [L194] COND FALSE !((int )m3 > (int )max3) [L199] newmax3 = newmax [L200] COND TRUE (int )r3 == 2 [L201] COND TRUE (int )max3 == (int )id3 [L202] st3 = (char)1 [L207] mode3 = (_Bool)0 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-1, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L438] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L484] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-1, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1, tmp=0] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-1, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L573] reach_error() VAL [ep12=0, ep13=0, ep21=0, ep23=1, ep31=0, ep32=0, id1=127, id2=0, id3=1, m1=-1, m2=127, m3=-1, max1=127, max2=0, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 172.0MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.95ms. Allocated memory is still 172.0MB. Free memory was 130.0MB in the beginning and 110.0MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.89ms. Allocated memory is still 172.0MB. Free memory was 110.0MB in the beginning and 107.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.74ms. Allocated memory is still 172.0MB. Free memory was 107.0MB in the beginning and 104.3MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2248.52ms. Allocated memory was 172.0MB in the beginning and 209.7MB in the end (delta: 37.7MB). Free memory was 104.3MB in the beginning and 108.9MB in the end (delta: -4.6MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. * CodeCheck took 512545.07ms. Allocated memory was 209.7MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 108.9MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 372.3MB. Max. memory is 16.1GB. * Witness Printer took 259.94ms. Allocated memory is still 5.3GB. Free memory was 4.9GB in the beginning and 4.8GB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 19:33:25,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1eeb7935-d98d-4c92-9bee-8c2bdfb03ab0/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE