./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b --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 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 04:09:21,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 04:09:21,359 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 04:09:21,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 04:09:21,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 04:09:21,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 04:09:21,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 04:09:21,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 04:09:21,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 04:09:21,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 04:09:21,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 04:09:21,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 04:09:21,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 04:09:21,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 04:09:21,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 04:09:21,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 04:09:21,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 04:09:21,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 04:09:21,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 04:09:21,386 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 04:09:21,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 04:09:21,386 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 04:09:21,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 04:09:21,387 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 04:09:21,387 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 04:09:21,387 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 04:09:21,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 04:09:21,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:09:21,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 04:09:21,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 04:09:21,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 04:09:21,387 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 04:09:21,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 04:09:21,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b 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 -> 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 [2024-12-06 04:09:21,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 04:09:21,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 04:09:21,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 04:09:21,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 04:09:21,634 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 04:09:21,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-12-06 04:09:24,264 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/data/30bba2dd4/6a5619c420d34d67967469f3109f4385/FLAGe02618c26 [2024-12-06 04:09:24,492 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 04:09:24,493 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-12-06 04:09:24,501 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/data/30bba2dd4/6a5619c420d34d67967469f3109f4385/FLAGe02618c26 [2024-12-06 04:09:24,867 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/data/30bba2dd4/6a5619c420d34d67967469f3109f4385 [2024-12-06 04:09:24,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 04:09:24,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 04:09:24,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 04:09:24,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 04:09:24,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 04:09:24,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:24" (1/1) ... [2024-12-06 04:09:24,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b19b048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:24, skipping insertion in model container [2024-12-06 04:09:24,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:24" (1/1) ... [2024-12-06 04:09:24,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 04:09:25,094 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_ee7746a0-5c50-4643-9451-86b15c193db9/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2024-12-06 04:09:25,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:09:25,105 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 04:09:25,151 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_ee7746a0-5c50-4643-9451-86b15c193db9/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2024-12-06 04:09:25,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:09:25,164 INFO L204 MainTranslator]: Completed translation [2024-12-06 04:09:25,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:25 WrapperNode [2024-12-06 04:09:25,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 04:09:25,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 04:09:25,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 04:09:25,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 04:09:25,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:25" (1/1) ... [2024-12-06 04:09:25,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:25" (1/1) ... [2024-12-06 04:09:25,206 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2024-12-06 04:09:25,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 04:09:25,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 04:09:25,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 04:09:25,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 04:09:25,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:25" (1/1) ... [2024-12-06 04:09:25,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:25" (1/1) ... [2024-12-06 04:09:25,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:25" (1/1) ... [2024-12-06 04:09:25,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:25" (1/1) ... [2024-12-06 04:09:25,224 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:25" (1/1) ... [2024-12-06 04:09:25,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:25" (1/1) ... [2024-12-06 04:09:25,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:25" (1/1) ... [2024-12-06 04:09:25,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:25" (1/1) ... [2024-12-06 04:09:25,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:25" (1/1) ... [2024-12-06 04:09:25,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 04:09:25,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 04:09:25,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 04:09:25,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 04:09:25,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:25" (1/1) ... [2024-12-06 04:09:25,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:09:25,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 04:09:25,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 04:09:25,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 04:09:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 04:09:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 04:09:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 04:09:25,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 04:09:25,367 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 04:09:25,369 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 04:09:25,803 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-12-06 04:09:25,803 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 04:09:26,271 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 04:09:26,271 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 04:09:26,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:26 BoogieIcfgContainer [2024-12-06 04:09:26,272 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 04:09:26,272 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 04:09:26,272 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 04:09:26,279 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 04:09:26,279 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:26" (1/1) ... [2024-12-06 04:09:26,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 04:09:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-12-06 04:09:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-12-06 04:09:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 04:09:26,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:26,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2024-12-06 04:09:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2024-12-06 04:09:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 04:09:27,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2024-12-06 04:09:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2024-12-06 04:09:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 04:09:28,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:28,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2024-12-06 04:09:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2024-12-06 04:09:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 04:09:29,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:29,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2024-12-06 04:09:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2024-12-06 04:09:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 04:09:30,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:30,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2024-12-06 04:09:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2024-12-06 04:09:32,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:09:32,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:32,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2024-12-06 04:09:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2024-12-06 04:09:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:09:33,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:33,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2024-12-06 04:09:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2024-12-06 04:09:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:09:34,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:34,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:34,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 56 states and 102 transitions. [2024-12-06 04:09:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 102 transitions. [2024-12-06 04:09:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:09:35,787 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:35,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 66 states and 120 transitions. [2024-12-06 04:09:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 120 transitions. [2024-12-06 04:09:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 04:09:37,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:37,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 69 states and 126 transitions. [2024-12-06 04:09:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 126 transitions. [2024-12-06 04:09:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 04:09:38,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:38,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 85 states and 163 transitions. [2024-12-06 04:09:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 163 transitions. [2024-12-06 04:09:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:09:43,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:43,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 99 states and 187 transitions. [2024-12-06 04:09:47,083 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 187 transitions. [2024-12-06 04:09:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:09:47,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:47,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 105 states and 202 transitions. [2024-12-06 04:09:49,409 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 202 transitions. [2024-12-06 04:09:49,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:09:49,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:49,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 123 states and 241 transitions. [2024-12-06 04:09:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 241 transitions. [2024-12-06 04:09:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:09:54,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:54,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:55,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 125 states and 247 transitions. [2024-12-06 04:09:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 247 transitions. [2024-12-06 04:09:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:09:55,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:09:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:09:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 126 states and 253 transitions. [2024-12-06 04:09:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 253 transitions. [2024-12-06 04:09:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:09:56,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:09:56,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:09:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:09:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 140 states and 287 transitions. [2024-12-06 04:10:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 287 transitions. [2024-12-06 04:10:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:10:01,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 141 states and 288 transitions. [2024-12-06 04:10:02,714 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 288 transitions. [2024-12-06 04:10:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:10:02,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:02,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 142 states and 294 transitions. [2024-12-06 04:10:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 294 transitions. [2024-12-06 04:10:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:10:03,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:03,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 143 states and 295 transitions. [2024-12-06 04:10:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 295 transitions. [2024-12-06 04:10:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:10:04,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:04,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 145 states and 303 transitions. [2024-12-06 04:10:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 303 transitions. [2024-12-06 04:10:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:10:06,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:06,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 156 states and 326 transitions. [2024-12-06 04:10:12,609 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 326 transitions. [2024-12-06 04:10:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:10:12,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:12,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 174 states and 362 transitions. [2024-12-06 04:10:18,858 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 362 transitions. [2024-12-06 04:10:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:10:18,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:18,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 175 states and 364 transitions. [2024-12-06 04:10:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 364 transitions. [2024-12-06 04:10:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:10:20,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 176 states and 365 transitions. [2024-12-06 04:10:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 365 transitions. [2024-12-06 04:10:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 04:10:22,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:22,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:26,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 184 states and 386 transitions. [2024-12-06 04:10:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 386 transitions. [2024-12-06 04:10:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 04:10:26,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:26,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 189 states and 398 transitions. [2024-12-06 04:10:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 398 transitions. [2024-12-06 04:10:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 04:10:29,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:29,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 192 states and 404 transitions. [2024-12-06 04:10:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 404 transitions. [2024-12-06 04:10:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 04:10:32,980 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:32,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 04:10:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 193 states and 405 transitions. [2024-12-06 04:10:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 405 transitions. [2024-12-06 04:10:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 04:10:33,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:33,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:34,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 201 states and 422 transitions. [2024-12-06 04:10:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 422 transitions. [2024-12-06 04:10:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 04:10:38,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:38,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 215 states and 479 transitions. [2024-12-06 04:10:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 479 transitions. [2024-12-06 04:10:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 04:10:46,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:46,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:10:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:10:56,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 229 states and 537 transitions. [2024-12-06 04:10:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 537 transitions. [2024-12-06 04:10:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 04:10:56,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:10:56,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:10:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:10:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:11:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:11:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 241 states and 564 transitions. [2024-12-06 04:11:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 564 transitions. [2024-12-06 04:11:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 04:11:04,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:11:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:11:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:11:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 04:11:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:11:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 253 states and 590 transitions. [2024-12-06 04:11:12,478 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 590 transitions. [2024-12-06 04:11:12,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 04:11:12,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:11:12,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:11:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:11:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:11:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:11:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 254 states and 595 transitions. [2024-12-06 04:11:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 595 transitions. [2024-12-06 04:11:16,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 04:11:16,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:11:16,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:11:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:11:18,496 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:11:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:11:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 263 states and 619 transitions. [2024-12-06 04:11:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 619 transitions. [2024-12-06 04:11:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:11:22,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:11:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:11:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:11:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:11:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:11:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 276 states and 650 transitions. [2024-12-06 04:11:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 650 transitions. [2024-12-06 04:11:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:11:30,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:11:30,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:11:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:11:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:11:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:11:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 285 states and 667 transitions. [2024-12-06 04:11:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 667 transitions. [2024-12-06 04:11:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:11:36,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:11:36,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:11:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:11:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:11:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:11:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 286 states and 670 transitions. [2024-12-06 04:11:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 670 transitions. [2024-12-06 04:11:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:11:38,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:11:38,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:11:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:11:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:11:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:11:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 300 states and 711 transitions. [2024-12-06 04:11:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 711 transitions. [2024-12-06 04:11:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:11:51,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:11:51,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:11:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:11:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:11:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:11:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 302 states and 730 transitions. [2024-12-06 04:11:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 730 transitions. [2024-12-06 04:11:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:11:54,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:11:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:11:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:11:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:11:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:11:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 303 states and 738 transitions. [2024-12-06 04:11:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 738 transitions. [2024-12-06 04:11:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:11:55,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:11:55,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:11:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:11:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:12:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:12:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 311 states and 763 transitions. [2024-12-06 04:12:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 763 transitions. [2024-12-06 04:12:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:12:04,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:12:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:12:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:12:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:12:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:12:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 321 states and 786 transitions. [2024-12-06 04:12:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 786 transitions. [2024-12-06 04:12:13,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:12:13,252 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:12:13,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:12:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:12:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:12:15,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:12:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 323 states and 805 transitions. [2024-12-06 04:12:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 805 transitions. [2024-12-06 04:12:15,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:12:15,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:12:15,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:12:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:12:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:12:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:12:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 338 states and 852 transitions. [2024-12-06 04:12:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 852 transitions. [2024-12-06 04:12:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:12:32,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:12:32,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:12:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:12:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:12:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:12:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 339 states and 862 transitions. [2024-12-06 04:12:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 862 transitions. [2024-12-06 04:12:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:12:34,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:12:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:12:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:12:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:12:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:12:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 345 states and 882 transitions. [2024-12-06 04:12:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 882 transitions. [2024-12-06 04:12:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:12:43,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:12:43,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:12:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:12:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:12:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:12:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 352 states and 907 transitions. [2024-12-06 04:12:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 907 transitions. [2024-12-06 04:12:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:12:54,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:12:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:12:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:12:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:12:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:12:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 353 states and 909 transitions. [2024-12-06 04:12:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 909 transitions. [2024-12-06 04:12:56,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:12:56,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:12:56,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:12:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:12:57,397 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 356 states and 923 transitions. [2024-12-06 04:13:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 923 transitions. [2024-12-06 04:13:00,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:13:00,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:00,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 357 states and 930 transitions. [2024-12-06 04:13:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 930 transitions. [2024-12-06 04:13:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:13:02,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:02,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 359 states and 949 transitions. [2024-12-06 04:13:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 949 transitions. [2024-12-06 04:13:06,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:13:06,493 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:06,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 360 states and 960 transitions. [2024-12-06 04:13:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 960 transitions. [2024-12-06 04:13:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:13:08,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:08,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 361 states and 969 transitions. [2024-12-06 04:13:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 969 transitions. [2024-12-06 04:13:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:13:11,223 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:11,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 368 states and 994 transitions. [2024-12-06 04:13:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 994 transitions. [2024-12-06 04:13:18,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:13:18,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:18,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 373 states and 1002 transitions. [2024-12-06 04:13:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1002 transitions. [2024-12-06 04:13:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:13:24,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 374 states and 1008 transitions. [2024-12-06 04:13:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1008 transitions. [2024-12-06 04:13:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:13:25,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 377 states and 1026 transitions. [2024-12-06 04:13:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1026 transitions. [2024-12-06 04:13:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:13:30,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:30,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 378 states and 1031 transitions. [2024-12-06 04:13:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1031 transitions. [2024-12-06 04:13:31,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:13:31,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 379 states and 1038 transitions. [2024-12-06 04:13:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1038 transitions. [2024-12-06 04:13:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:13:33,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 382 states and 1051 transitions. [2024-12-06 04:13:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1051 transitions. [2024-12-06 04:13:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:13:37,388 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:37,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 383 states and 1058 transitions. [2024-12-06 04:13:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1058 transitions. [2024-12-06 04:13:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:13:39,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 395 states and 1090 transitions. [2024-12-06 04:13:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1090 transitions. [2024-12-06 04:13:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:13:54,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:54,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:13:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:13:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:13:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 397 states and 1096 transitions. [2024-12-06 04:13:59,624 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1096 transitions. [2024-12-06 04:13:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:13:59,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:13:59,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:13:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:14:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 401 states and 1104 transitions. [2024-12-06 04:14:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1104 transitions. [2024-12-06 04:14:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:14:07,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:07,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:14:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 405 states and 1122 transitions. [2024-12-06 04:14:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1122 transitions. [2024-12-06 04:14:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:14:13,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:13,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:14:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 414 states and 1145 transitions. [2024-12-06 04:14:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1145 transitions. [2024-12-06 04:14:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:14:27,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:27,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:14:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 419 states and 1169 transitions. [2024-12-06 04:14:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 1169 transitions. [2024-12-06 04:14:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:14:35,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:35,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:14:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 425 states and 1175 transitions. [2024-12-06 04:14:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1175 transitions. [2024-12-06 04:14:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:14:42,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:42,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:14:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 432 states and 1197 transitions. [2024-12-06 04:14:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1197 transitions. [2024-12-06 04:14:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-06 04:14:52,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:52,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 04:14:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 432 states and 1196 transitions. [2024-12-06 04:14:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1196 transitions. [2024-12-06 04:14:53,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 04:14:53,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:14:54,267 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 04:14:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:14:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:14:55,625 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 04:14:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:14:56,100 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 73 iterations. [2024-12-06 04:14:56,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 04:14:56 ImpRootNode [2024-12-06 04:14:56,233 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 04:14:56,235 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 04:14:56,235 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 04:14:56,235 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 04:14:56,236 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:26" (3/4) ... [2024-12-06 04:14:56,237 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 04:14:56,379 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 176. [2024-12-06 04:14:56,492 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 04:14:56,492 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 04:14:56,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 04:14:56,493 INFO L158 Benchmark]: Toolchain (without parser) took 331619.79ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 116.1MB in the beginning and 616.9MB in the end (delta: -500.8MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-12-06 04:14:56,494 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:14:56,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.83ms. Allocated memory is still 142.6MB. Free memory was 115.8MB in the beginning and 99.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 04:14:56,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.89ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 96.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:14:56,495 INFO L158 Benchmark]: Boogie Preprocessor took 30.79ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 04:14:56,495 INFO L158 Benchmark]: RCFGBuilder took 1033.45ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 55.2MB in the end (delta: 39.0MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2024-12-06 04:14:56,495 INFO L158 Benchmark]: CodeCheck took 329960.96ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 55.2MB in the beginning and 642.1MB in the end (delta: -586.9MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-12-06 04:14:56,496 INFO L158 Benchmark]: Witness Printer took 257.92ms. Allocated memory is still 1.8GB. Free memory was 642.1MB in the beginning and 616.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 04:14:56,498 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: 329.8s, OverallIterations: 73, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40290 SdHoareTripleChecker+Valid, 231.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37890 mSDsluCounter, 16013 SdHoareTripleChecker+Invalid, 207.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14827 mSDsCounter, 15444 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124639 IncrementalHoareTripleChecker+Invalid, 140083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15444 mSolverCounterUnsat, 1186 mSDtfsCounter, 124639 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25686 GetRequests, 23101 SyntacticMatches, 1029 SemanticMatches, 1556 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446297 ImplicationChecksByTransitivity, 248.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 87.0s InterpolantComputationTime, 2256 NumberOfCodeBlocks, 2256 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 2136 ConstructedInterpolants, 0 QuantifiedInterpolants, 18650 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 72 InterpolantComputations, 12 PerfectInterpolantSequences, 315/1449 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 555]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] char id2 ; [L57] char r2 ; [L58] char st2 ; [L59] char nl2 ; [L60] char m2 ; [L61] char max2 ; [L62] _Bool mode2 ; [L63] char id3 ; [L64] char r3 ; [L65] char st3 ; [L66] char nl3 ; [L67] char m3 ; [L68] char max3 ; [L69] _Bool mode3 ; [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] ep12 = __VERIFIER_nondet_bool() [L482] ep13 = __VERIFIER_nondet_bool() [L483] ep21 = __VERIFIER_nondet_bool() [L484] ep23 = __VERIFIER_nondet_bool() [L485] ep31 = __VERIFIER_nondet_bool() [L486] ep32 = __VERIFIER_nondet_bool() [L487] id1 = __VERIFIER_nondet_char() [L488] r1 = __VERIFIER_nondet_char() [L489] st1 = __VERIFIER_nondet_char() [L490] nl1 = __VERIFIER_nondet_char() [L491] m1 = __VERIFIER_nondet_char() [L492] max1 = __VERIFIER_nondet_char() [L493] mode1 = __VERIFIER_nondet_bool() [L494] id2 = __VERIFIER_nondet_char() [L495] r2 = __VERIFIER_nondet_char() [L496] st2 = __VERIFIER_nondet_char() [L497] nl2 = __VERIFIER_nondet_char() [L498] m2 = __VERIFIER_nondet_char() [L499] max2 = __VERIFIER_nondet_char() [L500] mode2 = __VERIFIER_nondet_bool() [L501] id3 = __VERIFIER_nondet_char() [L502] r3 = __VERIFIER_nondet_char() [L503] st3 = __VERIFIER_nondet_char() [L504] nl3 = __VERIFIER_nondet_char() [L505] m3 = __VERIFIER_nondet_char() [L506] max3 = __VERIFIER_nondet_char() [L507] mode3 = __VERIFIER_nondet_bool() [L508] CALL, EXPR init() [L201] _Bool r121 ; [L202] _Bool r131 ; [L203] _Bool r211 ; [L204] _Bool r231 ; [L205] _Bool r311 ; [L206] _Bool r321 ; [L207] _Bool r122 ; [L208] int tmp ; [L209] _Bool r132 ; [L210] int tmp___0 ; [L211] _Bool r212 ; [L212] int tmp___1 ; [L213] _Bool r232 ; [L214] int tmp___2 ; [L215] _Bool r312 ; [L216] int tmp___3 ; [L217] _Bool r322 ; [L218] int tmp___4 ; [L219] int tmp___5 ; [L222] r121 = ep12 [L223] r131 = ep13 [L224] r211 = ep21 [L225] r231 = ep23 [L226] r311 = ep31 [L227] r321 = ep32 [L228] COND TRUE \read(r121) [L229] tmp = 1 [L240] r122 = (_Bool )tmp [L241] COND FALSE !(\read(r131)) [L244] COND TRUE \read(r121) [L245] COND TRUE \read(ep23) [L246] tmp___0 = 1 [L253] r132 = (_Bool )tmp___0 [L254] COND FALSE !(\read(r211)) [L257] COND TRUE \read(r231) [L258] COND TRUE \read(ep31) [L259] tmp___1 = 1 [L266] r212 = (_Bool )tmp___1 [L267] COND TRUE \read(r231) [L268] tmp___2 = 1 [L279] r232 = (_Bool )tmp___2 [L280] COND TRUE \read(r311) [L281] tmp___3 = 1 [L292] r312 = (_Bool )tmp___3 [L293] COND FALSE !(\read(r321)) [L296] COND TRUE \read(r311) [L297] COND TRUE \read(ep12) [L298] tmp___4 = 1 [L305] r322 = (_Bool )tmp___4 [L306] COND TRUE (int )id1 != (int )id2 [L307] COND TRUE (int )id1 != (int )id3 [L308] COND TRUE (int )id2 != (int )id3 [L309] COND TRUE (int )id1 >= 0 [L310] COND TRUE (int )id2 >= 0 [L311] COND TRUE (int )id3 >= 0 [L312] COND TRUE (int )r1 == 0 [L313] COND TRUE (int )r2 == 0 [L314] COND TRUE (int )r3 == 0 [L315] COND TRUE \read(r122) [L316] COND TRUE \read(r132) [L317] COND TRUE \read(r212) [L318] COND TRUE \read(r232) [L319] COND TRUE \read(r312) [L320] COND TRUE \read(r322) [L321] COND TRUE (int )max1 == (int )id1 [L322] COND TRUE (int )max2 == (int )id2 [L323] COND TRUE (int )max3 == (int )id3 [L324] COND TRUE (int )st1 == 0 [L325] COND TRUE (int )st2 == 0 [L326] COND TRUE (int )st3 == 0 [L327] COND TRUE (int )nl1 == 0 [L328] COND TRUE (int )nl2 == 0 [L329] COND TRUE (int )nl3 == 0 [L330] COND TRUE (int )mode1 == 0 [L331] COND TRUE (int )mode2 == 0 [L332] COND TRUE (int )mode3 == 0 [L333] tmp___5 = 1 [L415] return (tmp___5); [L508] RET, EXPR init() [L508] i2 = init() [L509] COND FALSE !(!(i2)) [L510] p12_old = nomsg [L511] p12_new = nomsg [L512] p13_old = nomsg [L513] p13_new = nomsg [L514] p21_old = nomsg [L515] p21_new = nomsg [L516] p23_old = nomsg [L517] p23_new = nomsg [L518] p31_old = nomsg [L519] p31_new = nomsg [L520] p32_old = nomsg [L521] p32_new = nomsg [L522] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=0, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND TRUE (int )r1 < 1 [L101] COND TRUE \read(ep12) [L102] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L104] COND FALSE !(\read(ep13)) [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND TRUE \read(ep23) [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=1, id1=1, id2=2, id3=3, m1=2, m2=0, m3=-2, max1=1, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L91] COND FALSE !((int )r1 == 2) [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND FALSE !((int )m2 > (int )max2) [L127] COND FALSE !(\read(ep32)) [L134] COND FALSE !((int )r2 == 2) [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND FALSE !((int )r3 == 2) [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=2, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND FALSE !(\read(mode1)) [L100] COND FALSE !((int )r1 < 1) [L108] mode1 = (_Bool)1 [L525] RET node1() [L526] CALL node2() [L118] COND FALSE !(\read(mode2)) [L143] COND TRUE (int )r2 < 2 [L144] COND FALSE !(\read(ep21)) [L147] COND TRUE \read(ep23) [L148] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L151] mode2 = (_Bool)1 [L526] RET node2() [L527] CALL node3() [L161] COND FALSE !(\read(mode3)) [L186] COND TRUE (int )r3 < 2 [L187] COND TRUE \read(ep31) [L188] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L190] COND FALSE !(\read(ep32)) [L194] mode3 = (_Bool)1 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L423] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L424] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L425] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L427] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L430] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L432] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND TRUE (int )r1 < 2 [L443] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] RET assert(c1) [L542] i2 ++ VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, i2=3, id1=1, id2=2, id3=3, m1=3, m2=1, m3=2, max1=3, max2=2, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L523] COND TRUE i2 < 6 [L525] CALL node1() [L75] COND TRUE \read(mode1) [L76] r1 = (char )((int )r1 + 1) [L77] COND FALSE !(\read(ep21)) [L84] COND TRUE \read(ep31) [L85] m1 = p31_old [L86] p31_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND TRUE (int )r1 == 2 [L92] COND FALSE !((int )max1 == (int )id1) [L95] nl1 = (char)1 [L98] mode1 = (_Bool)0 [L525] RET node1() [L526] CALL node2() [L118] COND TRUE \read(mode2) [L119] r2 = (char )((int )r2 + 1) [L120] COND TRUE \read(ep12) [L121] m2 = p12_old [L122] p12_old = nomsg [L123] COND FALSE !((int )m2 > (int )max2) [L127] COND FALSE !(\read(ep32)) [L134] COND TRUE (int )r2 == 2 [L135] COND TRUE (int )max2 == (int )id2 [L136] st2 = (char)1 [L141] mode2 = (_Bool)0 [L526] RET node2() [L527] CALL node3() [L161] COND TRUE \read(mode3) [L162] r3 = (char )((int )r3 + 1) [L163] COND FALSE !(\read(ep13)) [L170] COND TRUE \read(ep23) [L171] m3 = p23_old [L172] p23_old = nomsg [L173] COND FALSE !((int )m3 > (int )max3) [L177] COND TRUE (int )r3 == 2 [L178] COND TRUE (int )max3 == (int )id3 [L179] st3 = (char)1 [L184] mode3 = (_Bool)0 [L527] RET node3() [L528] p12_old = p12_new [L529] p12_new = nomsg [L530] p13_old = p13_new [L531] p13_new = nomsg [L532] p21_old = p21_new [L533] p21_new = nomsg [L534] p23_old = p23_new [L535] p23_new = nomsg [L536] p31_old = p31_new [L537] p31_new = nomsg [L538] p32_old = p32_new [L539] p32_new = nomsg [L540] CALL, EXPR check() [L420] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L423] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L469] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L471] return (tmp); [L540] RET, EXPR check() [L540] c1 = check() [L541] CALL assert(c1) [L553] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L555] reach_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=3, m1=3, m2=-1, m3=2, max1=3, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.83ms. Allocated memory is still 142.6MB. Free memory was 115.8MB in the beginning and 99.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.89ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 96.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.79ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1033.45ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 55.2MB in the end (delta: 39.0MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * CodeCheck took 329960.96ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 55.2MB in the beginning and 642.1MB in the end (delta: -586.9MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 257.92ms. Allocated memory is still 1.8GB. Free memory was 642.1MB in the beginning and 616.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 04:14:56,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee7746a0-5c50-4643-9451-86b15c193db9/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE