./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/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_aedcaf23-4d89-4101-99ab-38912baceb5b/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/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_aedcaf23-4d89-4101-99ab-38912baceb5b/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 a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:01:59,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:01:59,123 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:01:59,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:01:59,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:01:59,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:01:59,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:01:59,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:01:59,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:01:59,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:01:59,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:01:59,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:01:59,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:01:59,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:01:59,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:01:59,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:01:59,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:01:59,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:01:59,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:01:59,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:01:59,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:01:59,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:01:59,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:01:59,183 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:01:59,183 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:01:59,184 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:01:59,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:01:59,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:01:59,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:01:59,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:01:59,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:01:59,188 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:01:59,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:01:59,189 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_aedcaf23-4d89-4101-99ab-38912baceb5b/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_aedcaf23-4d89-4101-99ab-38912baceb5b/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 -> a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec [2024-11-08 23:01:59,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:01:59,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:01:59,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:01:59,539 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:01:59,540 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:01:59,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-08 23:02:01,634 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:02:01,938 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:02:01,941 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-11-08 23:02:01,962 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/bin/ukojak-verify-ImItNfHLgk/data/87a4caad5/39b9a78afa5146468f081285ec38b40b/FLAG8594eed98 [2024-11-08 23:02:01,984 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/bin/ukojak-verify-ImItNfHLgk/data/87a4caad5/39b9a78afa5146468f081285ec38b40b [2024-11-08 23:02:01,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:02:01,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:02:01,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:02:01,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:02:02,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:02:02,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:02:01" (1/1) ... [2024-11-08 23:02:02,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b49e8c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:02, skipping insertion in model container [2024-11-08 23:02:02,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:02:01" (1/1) ... [2024-11-08 23:02:02,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:02:02,383 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_aedcaf23-4d89-4101-99ab-38912baceb5b/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2024-11-08 23:02:02,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:02:02,411 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:02:02,489 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_aedcaf23-4d89-4101-99ab-38912baceb5b/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2024-11-08 23:02:02,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:02:02,512 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:02:02,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:02 WrapperNode [2024-11-08 23:02:02,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:02:02,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:02:02,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:02:02,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:02:02,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:02" (1/1) ... [2024-11-08 23:02:02,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:02" (1/1) ... [2024-11-08 23:02:02,596 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 483 [2024-11-08 23:02:02,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:02:02,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:02:02,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:02:02,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:02:02,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:02" (1/1) ... [2024-11-08 23:02:02,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:02" (1/1) ... [2024-11-08 23:02:02,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:02" (1/1) ... [2024-11-08 23:02:02,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:02" (1/1) ... [2024-11-08 23:02:02,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:02" (1/1) ... [2024-11-08 23:02:02,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:02" (1/1) ... [2024-11-08 23:02:02,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:02" (1/1) ... [2024-11-08 23:02:02,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:02" (1/1) ... [2024-11-08 23:02:02,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:02:02,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:02:02,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:02:02,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:02:02,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:02:02" (1/1) ... [2024-11-08 23:02:02,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:02:02,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:02:02,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:02:02,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:02:02,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:02:02,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:02:02,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:02:02,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:02:02,917 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:02:02,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:02:03,736 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-08 23:02:03,737 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:02:04,588 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:02:04,588 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:02:04,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:02:04 BoogieIcfgContainer [2024-11-08 23:02:04,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:02:04,590 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:02:04,590 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:02:04,601 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:02:04,601 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:02:04" (1/1) ... [2024-11-08 23:02:04,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:02:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-08 23:02:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-08 23:02:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:02:04,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:04,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:07,283 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 23:02:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-08 23:02:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-08 23:02:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:02:07,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:07,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:08,625 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 23:02:08,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-08 23:02:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-08 23:02:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:02:08,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:08,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:10,110 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 23:02:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-08 23:02:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-08 23:02:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:02:10,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:10,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:11,910 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 23:02:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:12,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-08 23:02:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-08 23:02:12,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:02:12,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:12,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:14,464 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 23:02:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:15,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-11-08 23:02:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-11-08 23:02:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:02:15,541 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:15,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:16,581 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 23:02:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-11-08 23:02:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-11-08 23:02:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:02:17,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:17,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:17,926 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 23:02:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-11-08 23:02:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-11-08 23:02:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:02:18,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:18,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:18,448 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 23:02:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2024-11-08 23:02:18,559 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2024-11-08 23:02:18,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:02:18,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:18,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:19,847 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 23:02:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2024-11-08 23:02:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2024-11-08 23:02:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:02:21,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:21,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:22,282 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 23:02:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2024-11-08 23:02:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2024-11-08 23:02:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 23:02:22,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:22,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:26,499 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 23:02:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 76 states and 132 transitions. [2024-11-08 23:02:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2024-11-08 23:02:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 23:02:30,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:32,673 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 23:02:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 90 states and 162 transitions. [2024-11-08 23:02:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 162 transitions. [2024-11-08 23:02:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 23:02:35,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:35,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:37,564 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 23:02:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 92 states and 166 transitions. [2024-11-08 23:02:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 166 transitions. [2024-11-08 23:02:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:02:38,247 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:38,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:40,684 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 23:02:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 106 states and 205 transitions. [2024-11-08 23:02:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 205 transitions. [2024-11-08 23:02:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:02:45,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:46,706 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 23:02:47,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 108 states and 214 transitions. [2024-11-08 23:02:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 214 transitions. [2024-11-08 23:02:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:02:47,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:47,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:49,579 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 23:02:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:50,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 109 states and 216 transitions. [2024-11-08 23:02:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 216 transitions. [2024-11-08 23:02:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:02:50,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:50,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:52,374 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 23:02:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:02:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 112 states and 225 transitions. [2024-11-08 23:02:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 225 transitions. [2024-11-08 23:02:54,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:02:54,088 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:02:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:02:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:02:55,889 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 23:03:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 126 states and 263 transitions. [2024-11-08 23:03:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 263 transitions. [2024-11-08 23:03:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:03:01,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:01,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:03,233 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 23:03:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 130 states and 282 transitions. [2024-11-08 23:03:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 282 transitions. [2024-11-08 23:03:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:03:05,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:05,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:06,900 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 23:03:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 132 states and 287 transitions. [2024-11-08 23:03:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 287 transitions. [2024-11-08 23:03:07,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:03:07,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:07,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:08,866 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 23:03:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 133 states and 289 transitions. [2024-11-08 23:03:09,309 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 289 transitions. [2024-11-08 23:03:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:03:09,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:09,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:10,401 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 23:03:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 134 states and 292 transitions. [2024-11-08 23:03:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 292 transitions. [2024-11-08 23:03:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:03:10,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:10,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:11,965 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 23:03:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 135 states and 294 transitions. [2024-11-08 23:03:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 294 transitions. [2024-11-08 23:03:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:03:12,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:14,307 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 23:03:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 139 states and 309 transitions. [2024-11-08 23:03:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 309 transitions. [2024-11-08 23:03:17,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:03:17,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:17,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:18,132 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 23:03:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 140 states and 310 transitions. [2024-11-08 23:03:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 310 transitions. [2024-11-08 23:03:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:03:18,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:21,325 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 23:03:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 160 states and 346 transitions. [2024-11-08 23:03:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 346 transitions. [2024-11-08 23:03:28,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 23:03:28,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:29,828 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 23:03:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 165 states and 361 transitions. [2024-11-08 23:03:32,031 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 361 transitions. [2024-11-08 23:03:32,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 23:03:32,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:32,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:34,708 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 23:03:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 170 states and 371 transitions. [2024-11-08 23:03:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 371 transitions. [2024-11-08 23:03:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 23:03:37,909 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:37,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:43,396 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 23:03:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:03:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 184 states and 421 transitions. [2024-11-08 23:03:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 421 transitions. [2024-11-08 23:03:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 23:03:52,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:03:52,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:03:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:03:54,778 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 23:04:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 195 states and 438 transitions. [2024-11-08 23:04:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 438 transitions. [2024-11-08 23:04:00,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:04:00,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:00,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:04,862 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 23:04:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 207 states and 468 transitions. [2024-11-08 23:04:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 468 transitions. [2024-11-08 23:04:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:04:13,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:13,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:16,898 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 23:04:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 208 states and 469 transitions. [2024-11-08 23:04:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 469 transitions. [2024-11-08 23:04:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:04:19,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:19,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:21,277 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 23:04:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 209 states and 470 transitions. [2024-11-08 23:04:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 470 transitions. [2024-11-08 23:04:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:04:23,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:24,314 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 23:04:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 210 states and 474 transitions. [2024-11-08 23:04:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 474 transitions. [2024-11-08 23:04:25,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:04:25,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:25,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:27,184 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 23:04:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 225 states and 509 transitions. [2024-11-08 23:04:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 509 transitions. [2024-11-08 23:04:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:04:35,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:35,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:36,371 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 23:04:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 227 states and 522 transitions. [2024-11-08 23:04:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 522 transitions. [2024-11-08 23:04:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:04:38,158 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:38,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:39,268 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 23:04:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 228 states and 523 transitions. [2024-11-08 23:04:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 523 transitions. [2024-11-08 23:04:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:04:40,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:40,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:43,273 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 23:04:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 232 states and 531 transitions. [2024-11-08 23:04:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 531 transitions. [2024-11-08 23:04:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:04:48,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:48,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:04:51,578 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 23:04:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:04:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 236 states and 554 transitions. [2024-11-08 23:04:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 554 transitions. [2024-11-08 23:04:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:04:56,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:04:56,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:04:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:01,462 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 23:05:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 249 states and 586 transitions. [2024-11-08 23:05:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 586 transitions. [2024-11-08 23:05:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:05:12,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:12,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:15,293 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 23:05:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 254 states and 608 transitions. [2024-11-08 23:05:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 608 transitions. [2024-11-08 23:05:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:05:20,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:20,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:22,078 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 23:05:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 255 states and 611 transitions. [2024-11-08 23:05:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 611 transitions. [2024-11-08 23:05:23,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:05:23,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:23,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:25,955 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 23:05:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 258 states and 621 transitions. [2024-11-08 23:05:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 621 transitions. [2024-11-08 23:05:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:05:30,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:30,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:32,355 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 23:05:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 263 states and 639 transitions. [2024-11-08 23:05:37,806 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 639 transitions. [2024-11-08 23:05:37,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:05:37,807 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:37,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:40,635 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 23:05:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:05:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 276 states and 677 transitions. [2024-11-08 23:05:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 677 transitions. [2024-11-08 23:05:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:05:52,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:05:52,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:05:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:05:55,570 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 23:06:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 288 states and 711 transitions. [2024-11-08 23:06:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 711 transitions. [2024-11-08 23:06:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:06:10,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:10,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:16,400 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 23:06:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 297 states and 731 transitions. [2024-11-08 23:06:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 731 transitions. [2024-11-08 23:06:27,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:06:27,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:27,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:06:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 23:06:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:06:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 297 states and 730 transitions. [2024-11-08 23:06:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 730 transitions. [2024-11-08 23:06:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 23:06:28,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:06:28,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:06:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:06:29,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:06:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:06:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:06:30,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:06:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:06:31,761 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 49 iterations. [2024-11-08 23:06:31,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:06:31 ImpRootNode [2024-11-08 23:06:31,927 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:06:31,927 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:06:31,928 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:06:31,928 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:06:31,928 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:02:04" (3/4) ... [2024-11-08 23:06:31,929 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 23:06:32,153 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:06:32,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:06:32,155 INFO L158 Benchmark]: Toolchain (without parser) took 270166.60ms. Allocated memory was 134.2MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 101.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-08 23:06:32,156 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 107.0MB. Free memory is still 63.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:06:32,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.16ms. Allocated memory is still 134.2MB. Free memory was 101.9MB in the beginning and 82.5MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:06:32,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.29ms. Allocated memory is still 134.2MB. Free memory was 82.5MB in the beginning and 78.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:06:32,157 INFO L158 Benchmark]: Boogie Preprocessor took 56.47ms. Allocated memory is still 134.2MB. Free memory was 78.9MB in the beginning and 75.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:06:32,157 INFO L158 Benchmark]: RCFGBuilder took 1934.68ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 75.8MB in the beginning and 110.3MB in the end (delta: -34.5MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2024-11-08 23:06:32,158 INFO L158 Benchmark]: CodeCheck took 267337.23ms. Allocated memory was 161.5MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 110.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 994.9MB. Max. memory is 16.1GB. [2024-11-08 23:06:32,158 INFO L158 Benchmark]: Witness Printer took 227.32ms. Allocated memory is still 2.8GB. Free memory was 1.8GB in the beginning and 1.7GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:06:32,160 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: 267.1s, OverallIterations: 49, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15912 SdHoareTripleChecker+Valid, 130.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14296 mSDsluCounter, 4821 SdHoareTripleChecker+Invalid, 117.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4043 mSDsCounter, 5637 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47056 IncrementalHoareTripleChecker+Invalid, 52693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5637 mSolverCounterUnsat, 778 mSDtfsCounter, 47056 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13300 GetRequests, 11600 SyntacticMatches, 680 SemanticMatches, 1020 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669446 ImplicationChecksByTransitivity, 182.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 92.1s InterpolantComputationTime, 1336 NumberOfCodeBlocks, 1336 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1240 ConstructedInterpolants, 0 QuantifiedInterpolants, 11280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 11 PerfectInterpolantSequences, 174/730 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 585]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L504] int c1 ; [L505] int i2 ; [L508] c1 = 0 [L509] ep12 = __VERIFIER_nondet_bool() [L510] ep13 = __VERIFIER_nondet_bool() [L511] ep21 = __VERIFIER_nondet_bool() [L512] ep23 = __VERIFIER_nondet_bool() [L513] ep31 = __VERIFIER_nondet_bool() [L514] ep32 = __VERIFIER_nondet_bool() [L515] id1 = __VERIFIER_nondet_char() [L516] r1 = __VERIFIER_nondet_uchar() [L517] st1 = __VERIFIER_nondet_char() [L518] nl1 = __VERIFIER_nondet_char() [L519] m1 = __VERIFIER_nondet_char() [L520] max1 = __VERIFIER_nondet_char() [L521] mode1 = __VERIFIER_nondet_bool() [L522] newmax1 = __VERIFIER_nondet_bool() [L523] id2 = __VERIFIER_nondet_char() [L524] r2 = __VERIFIER_nondet_uchar() [L525] st2 = __VERIFIER_nondet_char() [L526] nl2 = __VERIFIER_nondet_char() [L527] m2 = __VERIFIER_nondet_char() [L528] max2 = __VERIFIER_nondet_char() [L529] mode2 = __VERIFIER_nondet_bool() [L530] newmax2 = __VERIFIER_nondet_bool() [L531] id3 = __VERIFIER_nondet_char() [L532] r3 = __VERIFIER_nondet_uchar() [L533] st3 = __VERIFIER_nondet_char() [L534] nl3 = __VERIFIER_nondet_char() [L535] m3 = __VERIFIER_nondet_char() [L536] max3 = __VERIFIER_nondet_char() [L537] mode3 = __VERIFIER_nondet_bool() [L538] newmax3 = __VERIFIER_nondet_bool() [L539] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND TRUE \read(r121) [L269] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND TRUE \read(r121) [L285] COND FALSE !(\read(ep23)) [L288] tmp___0 = 0 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND FALSE !(\read(r231)) [L304] tmp___1 = 0 [L306] r212 = (_Bool )tmp___1 [L307] COND FALSE !(\read(r231)) [L310] COND FALSE !(\read(r211)) [L317] tmp___2 = 0 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND FALSE !(\read(r321)) [L330] tmp___3 = 0 [L332] r312 = (_Bool )tmp___3 [L333] COND FALSE !(\read(r321)) [L336] COND FALSE !(\read(r311)) [L343] tmp___4 = 0 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE (int )max1 == (int )id1 [L356] COND TRUE (int )max2 == (int )id2 [L357] COND TRUE (int )max3 == (int )id3 [L358] COND TRUE (int )st1 == 0 [L359] COND TRUE (int )st2 == 0 [L360] COND TRUE (int )st3 == 0 [L361] COND TRUE (int )nl1 == 0 [L362] COND TRUE (int )nl2 == 0 [L363] COND TRUE (int )nl3 == 0 [L364] COND TRUE (int )mode1 == 0 [L365] COND TRUE (int )mode2 == 0 [L366] COND TRUE (int )mode3 == 0 [L367] COND TRUE \read(newmax1) [L368] COND TRUE \read(newmax2) [L369] COND TRUE \read(newmax3) [L370] tmp___5 = 1 [L443] return (tmp___5); [L539] RET, EXPR init() [L539] i2 = init() [L540] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L540] RET assume_abort_if_not(i2) [L541] p12_old = nomsg [L542] p12_new = nomsg [L543] p13_old = nomsg [L544] p13_new = nomsg [L545] p21_old = nomsg [L546] p21_new = nomsg [L547] p23_old = nomsg [L548] p23_new = nomsg [L549] p31_old = nomsg [L550] p31_new = nomsg [L551] p32_old = nomsg [L552] p32_new = nomsg [L553] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=125, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=125, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=125, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=125, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=125, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=125, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=125, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=125, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L460] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=125, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=125, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=125, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=125, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=125, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=126, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L460] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND FALSE !(\read(newmax1)) [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L460] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=126, m3=1, max1=126, max2=127, max3=125, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND TRUE (int )max1 == (int )id1 [L107] st1 = (char)1 [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (char)1 [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=-1, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L451] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L497] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=-1, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1, tmp=0] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=-1, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L585] reach_error() VAL [ep12=1, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=126, id2=127, id3=125, m1=127, m2=-1, m3=1, max1=126, max2=127, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 107.0MB. Free memory is still 63.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.16ms. Allocated memory is still 134.2MB. Free memory was 101.9MB in the beginning and 82.5MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.29ms. Allocated memory is still 134.2MB. Free memory was 82.5MB in the beginning and 78.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.47ms. Allocated memory is still 134.2MB. Free memory was 78.9MB in the beginning and 75.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1934.68ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 75.8MB in the beginning and 110.3MB in the end (delta: -34.5MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * CodeCheck took 267337.23ms. Allocated memory was 161.5MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 110.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 994.9MB. Max. memory is 16.1GB. * Witness Printer took 227.32ms. Allocated memory is still 2.8GB. Free memory was 1.8GB in the beginning and 1.7GB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 23:06:32,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aedcaf23-4d89-4101-99ab-38912baceb5b/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE