./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.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_1e479a7b-955c-4b2f-962e-92f720917731/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e479a7b-955c-4b2f-962e-92f720917731/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_1e479a7b-955c-4b2f-962e-92f720917731/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e479a7b-955c-4b2f-962e-92f720917731/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e479a7b-955c-4b2f-962e-92f720917731/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_1e479a7b-955c-4b2f-962e-92f720917731/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 f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:31:58,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:31:58,533 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e479a7b-955c-4b2f-962e-92f720917731/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 19:31:58,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:31:58,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 19:31:58,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:31:58,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:31:58,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 19:31:58,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:31:58,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:31:58,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:31:58,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:31:58,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:31:58,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:31:58,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:31:58,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:31:58,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:31:58,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:31:58,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:31:58,604 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:31:58,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:31:58,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:31:58,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:31:58,608 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 19:31:58,609 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 19:31:58,609 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 19:31:58,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:31:58,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:31:58,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:31:58,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:31:58,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:31:58,611 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 19:31:58,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:31:58,614 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_1e479a7b-955c-4b2f-962e-92f720917731/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_1e479a7b-955c-4b2f-962e-92f720917731/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 -> f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 [2024-11-08 19:31:58,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:31:58,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:31:58,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:31:58,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:31:58,975 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:31:58,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e479a7b-955c-4b2f-962e-92f720917731/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-08 19:32:00,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:32:01,134 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:32:01,136 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e479a7b-955c-4b2f-962e-92f720917731/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2024-11-08 19:32:01,169 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e479a7b-955c-4b2f-962e-92f720917731/bin/ukojak-verify-ImItNfHLgk/data/f1c226cb1/a6f308f2cc86417d85f2905d0310aa33/FLAG6c7351f67 [2024-11-08 19:32:01,185 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e479a7b-955c-4b2f-962e-92f720917731/bin/ukojak-verify-ImItNfHLgk/data/f1c226cb1/a6f308f2cc86417d85f2905d0310aa33 [2024-11-08 19:32:01,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:32:01,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:32:01,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:32:01,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:32:01,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:32:01,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:32:01" (1/1) ... [2024-11-08 19:32:01,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae0e47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:01, skipping insertion in model container [2024-11-08 19:32:01,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:32:01" (1/1) ... [2024-11-08 19:32:01,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:32:01,553 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_1e479a7b-955c-4b2f-962e-92f720917731/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2024-11-08 19:32:01,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:32:01,577 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:32:01,683 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_1e479a7b-955c-4b2f-962e-92f720917731/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2024-11-08 19:32:01,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:32:01,711 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:32:01,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:01 WrapperNode [2024-11-08 19:32:01,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:32:01,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:32:01,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:32:01,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:32:01,721 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:32:01" (1/1) ... [2024-11-08 19:32:01,738 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:32:01" (1/1) ... [2024-11-08 19:32:01,795 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 453 [2024-11-08 19:32:01,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:32:01,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:32:01,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:32:01,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:32:01,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:01" (1/1) ... [2024-11-08 19:32:01,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:01" (1/1) ... [2024-11-08 19:32:01,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:01" (1/1) ... [2024-11-08 19:32:01,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:01" (1/1) ... [2024-11-08 19:32:01,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:01" (1/1) ... [2024-11-08 19:32:01,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:01" (1/1) ... [2024-11-08 19:32:01,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:01" (1/1) ... [2024-11-08 19:32:01,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:01" (1/1) ... [2024-11-08 19:32:01,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:32:01,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:32:01,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:32:01,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:32:01,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:32:01" (1/1) ... [2024-11-08 19:32:01,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:32:01,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e479a7b-955c-4b2f-962e-92f720917731/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 19:32:01,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e479a7b-955c-4b2f-962e-92f720917731/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:32:01,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e479a7b-955c-4b2f-962e-92f720917731/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:32:01,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:32:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 19:32:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:32:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:32:02,077 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:32:02,080 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:32:02,780 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-08 19:32:02,780 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:32:03,630 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:32:03,630 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:32:03,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:32:03 BoogieIcfgContainer [2024-11-08 19:32:03,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:32:03,632 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 19:32:03,632 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 19:32:03,646 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 19:32:03,646 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:32:03" (1/1) ... [2024-11-08 19:32:03,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:32:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-08 19:32:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-08 19:32:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 19:32:03,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:06,434 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:32:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-08 19:32:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-08 19:32:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 19:32:06,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:06,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:07,973 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:32:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-08 19:32:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-08 19:32:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:32:08,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:08,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:09,480 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:32:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-08 19:32:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-08 19:32:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 19:32:09,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:09,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:11,203 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:32:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-08 19:32:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-08 19:32:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 19:32:11,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:11,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:13,571 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:32:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-11-08 19:32:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-11-08 19:32:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 19:32:14,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:14,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:15,790 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:32:16,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-11-08 19:32:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-11-08 19:32:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 19:32:16,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:16,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:17,114 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:32:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-11-08 19:32:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-11-08 19:32:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:32:17,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:17,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:17,650 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:32:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2024-11-08 19:32:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2024-11-08 19:32:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 19:32:17,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:17,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:32:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2024-11-08 19:32:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2024-11-08 19:32:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 19:32:21,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:21,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:21,549 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:32:22,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2024-11-08 19:32:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2024-11-08 19:32:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 19:32:22,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:22,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:32:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 76 states and 134 transitions. [2024-11-08 19:32:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 134 transitions. [2024-11-08 19:32:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 19:32:29,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:29,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:30,906 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:32:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 83 states and 150 transitions. [2024-11-08 19:32:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 150 transitions. [2024-11-08 19:32:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:32:32,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:32,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:34,563 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:32:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 91 states and 175 transitions. [2024-11-08 19:32:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 175 transitions. [2024-11-08 19:32:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 19:32:37,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:37,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:39,404 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:32:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 93 states and 186 transitions. [2024-11-08 19:32:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 186 transitions. [2024-11-08 19:32:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:32:40,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:40,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:42,142 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:32:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 102 states and 208 transitions. [2024-11-08 19:32:45,101 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 208 transitions. [2024-11-08 19:32:45,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:32:45,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:45,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:46,947 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:32:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 106 states and 223 transitions. [2024-11-08 19:32:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 223 transitions. [2024-11-08 19:32:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:32:49,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:50,730 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:32:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 108 states and 228 transitions. [2024-11-08 19:32:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 228 transitions. [2024-11-08 19:32:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:32:51,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:51,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:52,766 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:32:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 109 states and 231 transitions. [2024-11-08 19:32:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 231 transitions. [2024-11-08 19:32:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:32:53,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:33:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 129 states and 273 transitions. [2024-11-08 19:33:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 273 transitions. [2024-11-08 19:33:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 19:33:03,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:03,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:33:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 137 states and 289 transitions. [2024-11-08 19:33:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 289 transitions. [2024-11-08 19:33:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 19:33:09,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:09,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:33:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 149 states and 314 transitions. [2024-11-08 19:33:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 314 transitions. [2024-11-08 19:33:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 19:33:19,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:19,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:33:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 146 states and 301 transitions. [2024-11-08 19:33:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 301 transitions. [2024-11-08 19:33:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 19:33:21,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:21,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:33:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 161 states and 349 transitions. [2024-11-08 19:33:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 349 transitions. [2024-11-08 19:33:34,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 19:33:34,565 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:33:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 175 states and 392 transitions. [2024-11-08 19:33:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 392 transitions. [2024-11-08 19:33:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 19:33:47,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:47,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:33:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:58,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 187 states and 427 transitions. [2024-11-08 19:33:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 427 transitions. [2024-11-08 19:33:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 19:33:58,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 197 states and 443 transitions. [2024-11-08 19:34:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 443 transitions. [2024-11-08 19:34:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 19:34:06,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:06,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 209 states and 474 transitions. [2024-11-08 19:34:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 474 transitions. [2024-11-08 19:34:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 19:34:16,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:16,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:18,209 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 210 states and 476 transitions. [2024-11-08 19:34:19,396 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 476 transitions. [2024-11-08 19:34:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 19:34:19,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:19,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 226 states and 516 transitions. [2024-11-08 19:34:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 516 transitions. [2024-11-08 19:34:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 19:34:30,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:30,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 233 states and 531 transitions. [2024-11-08 19:34:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 531 transitions. [2024-11-08 19:34:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 19:34:38,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:38,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 239 states and 548 transitions. [2024-11-08 19:34:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 548 transitions. [2024-11-08 19:34:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 19:34:44,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:44,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:34:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 249 states and 575 transitions. [2024-11-08 19:34:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 575 transitions. [2024-11-08 19:34:56,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 19:34:56,136 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:56,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 261 states and 605 transitions. [2024-11-08 19:35:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 605 transitions. [2024-11-08 19:35:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 19:35:13,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 270 states and 623 transitions. [2024-11-08 19:35:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 623 transitions. [2024-11-08 19:35:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 19:35:29,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:29,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 273 states and 627 transitions. [2024-11-08 19:35:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 627 transitions. [2024-11-08 19:35:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 19:35:34,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:34,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 275 states and 634 transitions. [2024-11-08 19:35:37,697 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 634 transitions. [2024-11-08 19:35:37,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 19:35:37,698 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:37,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 276 states and 640 transitions. [2024-11-08 19:35:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 640 transitions. [2024-11-08 19:35:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 19:35:44,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:44,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:35:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:35:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:35:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 285 states and 671 transitions. [2024-11-08 19:35:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 671 transitions. [2024-11-08 19:35:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 19:35:59,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:35:59,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:35:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:36:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:36:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 284 states and 668 transitions. [2024-11-08 19:36:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 668 transitions. [2024-11-08 19:36:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 19:36:09,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:36:09,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:36:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:36:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 289 states and 682 transitions. [2024-11-08 19:36:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 682 transitions. [2024-11-08 19:36:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 19:36:19,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:36:19,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:36:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:36:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 297 states and 707 transitions. [2024-11-08 19:36:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 707 transitions. [2024-11-08 19:36:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 19:36:30,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:36:30,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:36:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:36:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 300 states and 716 transitions. [2024-11-08 19:36:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 716 transitions. [2024-11-08 19:36:36,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 19:36:36,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:36:36,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:36:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:36:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 301 states and 717 transitions. [2024-11-08 19:36:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 717 transitions. [2024-11-08 19:36:39,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:36:39,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:36:39,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:36:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:36:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 311 states and 743 transitions. [2024-11-08 19:36:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 743 transitions. [2024-11-08 19:36:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:36:54,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:36:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:36:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:36:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 319 states and 763 transitions. [2024-11-08 19:37:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 763 transitions. [2024-11-08 19:37:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:37:05,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:05,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 323 states and 792 transitions. [2024-11-08 19:37:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 792 transitions. [2024-11-08 19:37:15,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:37:15,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:15,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 335 states and 820 transitions. [2024-11-08 19:37:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 820 transitions. [2024-11-08 19:37:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:37:31,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:31,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 338 states and 829 transitions. [2024-11-08 19:37:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 829 transitions. [2024-11-08 19:37:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:37:37,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:37,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 349 states and 861 transitions. [2024-11-08 19:37:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 861 transitions. [2024-11-08 19:37:49,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 19:37:49,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:49,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:37:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:37:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 350 states and 862 transitions. [2024-11-08 19:37:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 862 transitions. [2024-11-08 19:37:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:37:53,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:37:53,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:37:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:37:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:38:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 356 states and 868 transitions. [2024-11-08 19:38:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 868 transitions. [2024-11-08 19:38:08,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:38:08,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:08,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:38:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 362 states and 895 transitions. [2024-11-08 19:38:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 895 transitions. [2024-11-08 19:38:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:38:22,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:22,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:38:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 365 states and 908 transitions. [2024-11-08 19:38:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 908 transitions. [2024-11-08 19:38:27,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:38:27,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:38:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 369 states and 929 transitions. [2024-11-08 19:38:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 929 transitions. [2024-11-08 19:38:43,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:38:43,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:43,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:38:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:38:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:38:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 373 states and 946 transitions. [2024-11-08 19:38:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 946 transitions. [2024-11-08 19:38:59,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 19:38:59,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:38:59,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:38:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:39:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:39:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:39:14,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 375 states and 954 transitions. [2024-11-08 19:39:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 954 transitions. [2024-11-08 19:39:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 19:39:14,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:39:14,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:39:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:39:15,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:39:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:39:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:39:16,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:39:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:39:17,247 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 57 iterations. [2024-11-08 19:39:17,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 07:39:17 ImpRootNode [2024-11-08 19:39:17,359 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 19:39:17,360 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:39:17,360 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:39:17,360 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:39:17,361 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:32:03" (3/4) ... [2024-11-08 19:39:17,365 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 19:39:17,559 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e479a7b-955c-4b2f-962e-92f720917731/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 19:39:17,559 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:39:17,560 INFO L158 Benchmark]: Toolchain (without parser) took 436372.23ms. Allocated memory was 161.5MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 133.6MB in the beginning and 4.2GB in the end (delta: -4.0GB). Peak memory consumption was 343.4MB. Max. memory is 16.1GB. [2024-11-08 19:39:17,560 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 121.6MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:39:17,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.44ms. Allocated memory is still 161.5MB. Free memory was 133.3MB in the beginning and 116.0MB in the end (delta: 17.4MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-08 19:39:17,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.67ms. Allocated memory is still 161.5MB. Free memory was 116.0MB in the beginning and 112.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:39:17,561 INFO L158 Benchmark]: Boogie Preprocessor took 69.98ms. Allocated memory is still 161.5MB. Free memory was 112.5MB in the beginning and 109.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:39:17,562 INFO L158 Benchmark]: RCFGBuilder took 1760.20ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 109.7MB in the beginning and 109.0MB in the end (delta: 610.5kB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-08 19:39:17,562 INFO L158 Benchmark]: CodeCheck took 433727.48ms. Allocated memory was 195.0MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 109.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 269.7MB. Max. memory is 16.1GB. [2024-11-08 19:39:17,562 INFO L158 Benchmark]: Witness Printer took 199.77ms. Allocated memory is still 4.5GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:39:17,564 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 433.6s, OverallIterations: 57, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27353 SdHoareTripleChecker+Valid, 201.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25450 mSDsluCounter, 10273 SdHoareTripleChecker+Invalid, 182.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9359 mSDsCounter, 10235 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80088 IncrementalHoareTripleChecker+Invalid, 90323 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10235 mSolverCounterUnsat, 914 mSDtfsCounter, 80088 mSolverCounterSat, 1.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17578 GetRequests, 15302 SyntacticMatches, 894 SemanticMatches, 1382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238385 ImplicationChecksByTransitivity, 323.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 5.7s SatisfiabilityAnalysisTime, 133.0s InterpolantComputationTime, 1746 NumberOfCodeBlocks, 1746 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1642 ConstructedInterpolants, 0 QuantifiedInterpolants, 16335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 56 InterpolantComputations, 10 PerfectInterpolantSequences, 194/1122 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: 567]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L489] int c1 ; [L490] int i2 ; [L493] c1 = 0 [L494] ep12 = __VERIFIER_nondet_bool() [L495] ep13 = __VERIFIER_nondet_bool() [L496] ep21 = __VERIFIER_nondet_bool() [L497] ep23 = __VERIFIER_nondet_bool() [L498] ep31 = __VERIFIER_nondet_bool() [L499] ep32 = __VERIFIER_nondet_bool() [L500] id1 = __VERIFIER_nondet_char() [L501] r1 = __VERIFIER_nondet_uchar() [L502] st1 = __VERIFIER_nondet_char() [L503] nl1 = __VERIFIER_nondet_char() [L504] m1 = __VERIFIER_nondet_char() [L505] max1 = __VERIFIER_nondet_char() [L506] mode1 = __VERIFIER_nondet_bool() [L507] id2 = __VERIFIER_nondet_char() [L508] r2 = __VERIFIER_nondet_uchar() [L509] st2 = __VERIFIER_nondet_char() [L510] nl2 = __VERIFIER_nondet_char() [L511] m2 = __VERIFIER_nondet_char() [L512] max2 = __VERIFIER_nondet_char() [L513] mode2 = __VERIFIER_nondet_bool() [L514] id3 = __VERIFIER_nondet_char() [L515] r3 = __VERIFIER_nondet_uchar() [L516] st3 = __VERIFIER_nondet_char() [L517] nl3 = __VERIFIER_nondet_char() [L518] m3 = __VERIFIER_nondet_char() [L519] max3 = __VERIFIER_nondet_char() [L520] mode3 = __VERIFIER_nondet_bool() [L521] CALL, EXPR init() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND FALSE !(\read(r121)) [L244] COND TRUE \read(r131) [L245] COND TRUE \read(ep32) [L246] tmp = 1 [L253] r122 = (_Bool )tmp [L254] COND TRUE \read(r131) [L255] tmp___0 = 1 [L266] r132 = (_Bool )tmp___0 [L267] COND TRUE \read(r211) [L268] tmp___1 = 1 [L279] r212 = (_Bool )tmp___1 [L280] COND FALSE !(\read(r231)) [L283] COND TRUE \read(r211) [L284] COND TRUE \read(ep13) [L285] tmp___2 = 1 [L292] r232 = (_Bool )tmp___2 [L293] COND FALSE !(\read(r311)) [L296] COND TRUE \read(r321) [L297] COND TRUE \read(ep21) [L298] tmp___3 = 1 [L305] r312 = (_Bool )tmp___3 [L306] COND TRUE \read(r321) [L307] tmp___4 = 1 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE \read(r122) [L329] COND TRUE \read(r132) [L330] COND TRUE \read(r212) [L331] COND TRUE \read(r232) [L332] COND TRUE \read(r312) [L333] COND TRUE \read(r322) [L334] COND TRUE (int )max1 == (int )id1 [L335] COND TRUE (int )max2 == (int )id2 [L336] COND TRUE (int )max3 == (int )id3 [L337] COND TRUE (int )st1 == 0 [L338] COND TRUE (int )st2 == 0 [L339] COND TRUE (int )st3 == 0 [L340] COND TRUE (int )nl1 == 0 [L341] COND TRUE (int )nl2 == 0 [L342] COND TRUE (int )nl3 == 0 [L343] COND TRUE (int )mode1 == 0 [L344] COND TRUE (int )mode2 == 0 [L345] COND TRUE (int )mode3 == 0 [L346] tmp___5 = 1 [L428] return (tmp___5); [L521] RET, EXPR init() [L521] i2 = init() [L522] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L522] RET assume_abort_if_not(i2) [L523] p12_old = nomsg [L524] p12_new = nomsg [L525] p13_old = nomsg [L526] p13_new = nomsg [L527] p21_old = nomsg [L528] p21_new = nomsg [L529] p23_old = nomsg [L530] p23_new = nomsg [L531] p31_old = nomsg [L532] p31_new = nomsg [L533] p32_old = nomsg [L534] p32_new = nomsg [L535] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=127, m3=0, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=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=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L536] COND TRUE 1 [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 1 [L108] COND FALSE !(\read(ep12)) [L111] COND TRUE \read(ep13) [L112] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND TRUE \read(ep21) [L155] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND FALSE !(\read(ep31)) [L203] COND TRUE \read(ep32) [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=127, m3=0, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=127, m3=0, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=127, m3=0, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=127, m3=0, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=127, m3=0, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=127, m3=0, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=127, m3=0, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=127, m3=0, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=127, m3=0, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=127, m3=0, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=127, m3=0, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=3, m2=127, m3=0, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=256, r2=0, r3=0, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L91] COND FALSE !(\read(ep31)) [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [L137] COND TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND FALSE !((int )m2 > (int )max2) [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND TRUE \read(ep13) [L177] m3 = p13_old [L178] p13_old = nomsg [L179] COND FALSE !((int )m3 > (int )max3) [L183] COND FALSE !(\read(ep23)) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=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] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=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] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=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 )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=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 )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=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] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=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 )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=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] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=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 )r1 < 2 [L456] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=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] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=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] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND FALSE !((int )r1 < 1) [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND TRUE \read(ep21) [L155] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND FALSE !(\read(ep31)) [L203] COND TRUE \read(ep32) [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=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=2, 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] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=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=2, 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] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=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=2, 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 )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=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=2, 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 )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=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=2, 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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=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=2, 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] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=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=2, 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 )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=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=2, 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] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=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=2, 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 )r1 < 2 [L456] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=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=2, 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] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=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=2, 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] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND FALSE !(\read(ep31)) [L98] COND TRUE (int )r1 == 2 [L99] COND FALSE !((int )max1 == (int )id1) [L102] nl1 = (char)1 [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [L137] COND TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND FALSE !((int )m2 > (int )max2) [L144] COND TRUE (int )r2 == 2 [L145] COND TRUE (int )max2 == (int )id2 [L146] st2 = (char)1 [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND TRUE \read(ep13) [L177] m3 = p13_old [L178] p13_old = nomsg [L179] COND FALSE !((int )m3 > (int )max3) [L183] COND FALSE !(\read(ep23)) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=-1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L436] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L482] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=-1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=-1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L567] reach_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=-1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 121.6MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.44ms. Allocated memory is still 161.5MB. Free memory was 133.3MB in the beginning and 116.0MB in the end (delta: 17.4MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.67ms. Allocated memory is still 161.5MB. Free memory was 116.0MB in the beginning and 112.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.98ms. Allocated memory is still 161.5MB. Free memory was 112.5MB in the beginning and 109.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1760.20ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 109.7MB in the beginning and 109.0MB in the end (delta: 610.5kB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * CodeCheck took 433727.48ms. Allocated memory was 195.0MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 109.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 269.7MB. Max. memory is 16.1GB. * Witness Printer took 199.77ms. Allocated memory is still 4.5GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 19:39:17,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e479a7b-955c-4b2f-962e-92f720917731/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