./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/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_1845f114-42bd-4b9a-8963-0b28e22dd5c4/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/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_1845f114-42bd-4b9a-8963-0b28e22dd5c4/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 f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 00:21:29,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 00:21:30,028 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 00:21:30,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 00:21:30,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 00:21:30,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 00:21:30,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 00:21:30,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 00:21:30,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 00:21:30,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 00:21:30,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 00:21:30,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 00:21:30,053 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 00:21:30,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 00:21:30,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 00:21:30,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 00:21:30,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 00:21:30,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 00:21:30,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 00:21:30,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 00:21:30,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 00:21:30,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 00:21:30,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 00:21:30,054 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 00:21:30,054 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 00:21:30,054 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 00:21:30,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 00:21:30,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:21:30,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 00:21:30,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 00:21:30,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 00:21:30,055 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 00:21:30,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 00:21:30,055 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_1845f114-42bd-4b9a-8963-0b28e22dd5c4/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 -> f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 [2024-12-06 00:21:30,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 00:21:30,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 00:21:30,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 00:21:30,299 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 00:21:30,299 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 00:21:30,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2024-12-06 00:21:32,972 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/bin/ukojak-verify-CZk0znPC7b/data/a2e869008/0698d16b273f4fb49ad108bee91c5e80/FLAG9c23ca958 [2024-12-06 00:21:33,192 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 00:21:33,192 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2024-12-06 00:21:33,201 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/bin/ukojak-verify-CZk0znPC7b/data/a2e869008/0698d16b273f4fb49ad108bee91c5e80/FLAG9c23ca958 [2024-12-06 00:21:33,539 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/bin/ukojak-verify-CZk0znPC7b/data/a2e869008/0698d16b273f4fb49ad108bee91c5e80 [2024-12-06 00:21:33,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 00:21:33,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 00:21:33,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 00:21:33,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 00:21:33,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 00:21:33,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf203b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33, skipping insertion in model container [2024-12-06 00:21:33,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 00:21:33,755 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_1845f114-42bd-4b9a-8963-0b28e22dd5c4/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2024-12-06 00:21:33,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:21:33,767 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 00:21:33,813 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_1845f114-42bd-4b9a-8963-0b28e22dd5c4/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2024-12-06 00:21:33,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:21:33,829 INFO L204 MainTranslator]: Completed translation [2024-12-06 00:21:33,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33 WrapperNode [2024-12-06 00:21:33,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 00:21:33,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 00:21:33,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 00:21:33,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 00:21:33,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,877 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 453 [2024-12-06 00:21:33,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 00:21:33,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 00:21:33,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 00:21:33,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 00:21:33,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 00:21:33,913 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 00:21:33,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 00:21:33,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 00:21:33,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:21:33" (1/1) ... [2024-12-06 00:21:33,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:21:33,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 00:21:33,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 00:21:33,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 00:21:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 00:21:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 00:21:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 00:21:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 00:21:34,051 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 00:21:34,053 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 00:21:34,525 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-12-06 00:21:34,526 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 00:21:35,044 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 00:21:35,044 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 00:21:35,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:21:35 BoogieIcfgContainer [2024-12-06 00:21:35,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 00:21:35,045 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 00:21:35,045 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 00:21:35,052 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 00:21:35,053 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:21:35" (1/1) ... [2024-12-06 00:21:35,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 00:21:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-12-06 00:21:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-12-06 00:21:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 00:21:35,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:35,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:36,755 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 00:21:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-12-06 00:21:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-12-06 00:21:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 00:21:36,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:36,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:37,785 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 00:21:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-12-06 00:21:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-12-06 00:21:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 00:21:38,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:38,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:38,901 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 00:21:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-12-06 00:21:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-12-06 00:21:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 00:21:39,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:39,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:40,156 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 00:21:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-12-06 00:21:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-12-06 00:21:40,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 00:21:40,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:41,744 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 00:21:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-12-06 00:21:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-12-06 00:21:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 00:21:42,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:42,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:43,180 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 00:21:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-12-06 00:21:43,927 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-12-06 00:21:43,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 00:21:43,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:43,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:44,005 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 00:21:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-12-06 00:21:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-12-06 00:21:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 00:21:44,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:44,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:44,341 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 00:21:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2024-12-06 00:21:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2024-12-06 00:21:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 00:21:44,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:44,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:45,179 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 00:21:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2024-12-06 00:21:46,448 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2024-12-06 00:21:46,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 00:21:46,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:46,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:46,692 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 00:21:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2024-12-06 00:21:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2024-12-06 00:21:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 00:21:47,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:47,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:48,686 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 00:21:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 76 states and 134 transitions. [2024-12-06 00:21:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 134 transitions. [2024-12-06 00:21:51,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 00:21:51,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:52,284 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 00:21:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 83 states and 151 transitions. [2024-12-06 00:21:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 151 transitions. [2024-12-06 00:21:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 00:21:53,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:53,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:54,646 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 00:21:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 89 states and 169 transitions. [2024-12-06 00:21:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 169 transitions. [2024-12-06 00:21:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 00:21:55,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:21:57,086 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 00:21:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:21:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 97 states and 192 transitions. [2024-12-06 00:21:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 192 transitions. [2024-12-06 00:21:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 00:21:59,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:21:59,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:21:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:00,205 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 00:22:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 98 states and 196 transitions. [2024-12-06 00:22:00,690 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 196 transitions. [2024-12-06 00:22:00,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 00:22:00,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:00,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:01,768 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 00:22:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 105 states and 218 transitions. [2024-12-06 00:22:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 218 transitions. [2024-12-06 00:22:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 00:22:03,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:03,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:04,777 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 00:22:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 112 states and 240 transitions. [2024-12-06 00:22:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 240 transitions. [2024-12-06 00:22:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 00:22:07,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:07,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:08,098 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 00:22:08,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 114 states and 245 transitions. [2024-12-06 00:22:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 245 transitions. [2024-12-06 00:22:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 00:22:08,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:08,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:09,725 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 00:22:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 119 states and 262 transitions. [2024-12-06 00:22:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 262 transitions. [2024-12-06 00:22:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 00:22:11,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:11,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:12,489 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 00:22:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 120 states and 268 transitions. [2024-12-06 00:22:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 268 transitions. [2024-12-06 00:22:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 00:22:12,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:12,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:14,861 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 00:22:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 140 states and 299 transitions. [2024-12-06 00:22:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 299 transitions. [2024-12-06 00:22:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 00:22:19,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:19,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:20,428 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 00:22:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 145 states and 310 transitions. [2024-12-06 00:22:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 310 transitions. [2024-12-06 00:22:22,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 00:22:22,012 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:22,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:24,276 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 00:22:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 154 states and 328 transitions. [2024-12-06 00:22:27,780 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 328 transitions. [2024-12-06 00:22:27,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 00:22:27,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:27,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 00:22:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 154 states and 327 transitions. [2024-12-06 00:22:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 327 transitions. [2024-12-06 00:22:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 00:22:28,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:28,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:30,764 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 00:22:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 169 states and 385 transitions. [2024-12-06 00:22:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 385 transitions. [2024-12-06 00:22:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 00:22:37,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:37,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:39,712 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 00:22:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 180 states and 430 transitions. [2024-12-06 00:22:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 430 transitions. [2024-12-06 00:22:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 00:22:46,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:46,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:47,942 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 00:22:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 186 states and 441 transitions. [2024-12-06 00:22:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 441 transitions. [2024-12-06 00:22:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 00:22:51,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:51,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:22:52,737 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 00:22:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:22:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 194 states and 461 transitions. [2024-12-06 00:22:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 461 transitions. [2024-12-06 00:22:56,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 00:22:56,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:22:56,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:22:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:00,240 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 00:23:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 207 states and 488 transitions. [2024-12-06 00:23:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 488 transitions. [2024-12-06 00:23:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 00:23:07,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:07,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:08,962 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 00:23:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 208 states and 500 transitions. [2024-12-06 00:23:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 500 transitions. [2024-12-06 00:23:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 00:23:10,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:10,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:12,276 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 00:23:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 212 states and 512 transitions. [2024-12-06 00:23:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 512 transitions. [2024-12-06 00:23:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 00:23:15,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:15,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:18,279 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 00:23:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 214 states and 524 transitions. [2024-12-06 00:23:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 524 transitions. [2024-12-06 00:23:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 00:23:20,558 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:20,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:22,223 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 00:23:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 223 states and 547 transitions. [2024-12-06 00:23:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 547 transitions. [2024-12-06 00:23:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 00:23:28,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:28,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:29,848 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 00:23:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 234 states and 583 transitions. [2024-12-06 00:23:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 583 transitions. [2024-12-06 00:23:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 00:23:36,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:36,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:37,689 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 00:23:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 239 states and 597 transitions. [2024-12-06 00:23:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 597 transitions. [2024-12-06 00:23:40,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:23:40,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:40,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:42,511 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 00:23:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 244 states and 614 transitions. [2024-12-06 00:23:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 614 transitions. [2024-12-06 00:23:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:23:47,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:47,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:48,905 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 00:23:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 252 states and 631 transitions. [2024-12-06 00:23:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 631 transitions. [2024-12-06 00:23:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:23:54,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:55,100 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 00:23:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:23:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 254 states and 648 transitions. [2024-12-06 00:23:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 648 transitions. [2024-12-06 00:23:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:23:56,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:23:56,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:23:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:23:57,922 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 00:24:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 261 states and 664 transitions. [2024-12-06 00:24:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 664 transitions. [2024-12-06 00:24:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:24:03,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:03,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:04,418 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 00:24:05,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 262 states and 665 transitions. [2024-12-06 00:24:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 665 transitions. [2024-12-06 00:24:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:24:05,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:05,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:06,805 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 00:24:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 264 states and 674 transitions. [2024-12-06 00:24:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 674 transitions. [2024-12-06 00:24:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:24:08,861 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:08,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:09,872 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 00:24:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 265 states and 679 transitions. [2024-12-06 00:24:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 679 transitions. [2024-12-06 00:24:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 00:24:10,707 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:12,866 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 00:24:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 270 states and 714 transitions. [2024-12-06 00:24:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 714 transitions. [2024-12-06 00:24:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 00:24:19,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:19,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:21,736 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 00:24:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 274 states and 723 transitions. [2024-12-06 00:24:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 723 transitions. [2024-12-06 00:24:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 00:24:26,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:26,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:28,243 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 00:24:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 278 states and 746 transitions. [2024-12-06 00:24:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 746 transitions. [2024-12-06 00:24:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 00:24:31,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:31,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:32,870 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 00:24:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 282 states and 753 transitions. [2024-12-06 00:24:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 753 transitions. [2024-12-06 00:24:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 00:24:36,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:36,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:38,379 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 00:24:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 285 states and 761 transitions. [2024-12-06 00:24:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 761 transitions. [2024-12-06 00:24:40,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 00:24:40,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:40,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:41,533 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 00:24:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 292 states and 789 transitions. [2024-12-06 00:24:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 789 transitions. [2024-12-06 00:24:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 00:24:47,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:47,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:48,276 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 00:24:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 298 states and 803 transitions. [2024-12-06 00:24:52,354 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 803 transitions. [2024-12-06 00:24:52,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 00:24:52,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:52,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:53,370 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 00:24:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 301 states and 809 transitions. [2024-12-06 00:24:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 809 transitions. [2024-12-06 00:24:56,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 00:24:56,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:56,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:58,455 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:25:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 313 states and 841 transitions. [2024-12-06 00:25:06,329 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 841 transitions. [2024-12-06 00:25:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 00:25:06,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:06,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:25:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 321 states and 854 transitions. [2024-12-06 00:25:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 854 transitions. [2024-12-06 00:25:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 00:25:11,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:11,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:14,190 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 00:25:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 331 states and 879 transitions. [2024-12-06 00:25:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 879 transitions. [2024-12-06 00:25:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 00:25:21,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:21,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:23,394 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 00:25:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 339 states and 895 transitions. [2024-12-06 00:25:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 895 transitions. [2024-12-06 00:25:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 00:25:28,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:28,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:29,723 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 00:25:34,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 344 states and 913 transitions. [2024-12-06 00:25:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 913 transitions. [2024-12-06 00:25:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 00:25:34,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:34,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:25:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 353 states and 936 transitions. [2024-12-06 00:25:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 936 transitions. [2024-12-06 00:25:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 00:25:49,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:49,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:52,030 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 00:26:02,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:26:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 363 states and 958 transitions. [2024-12-06 00:26:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 958 transitions. [2024-12-06 00:26:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-06 00:26:02,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:26:02,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:26:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:26:02,538 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 00:26:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:26:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 363 states and 957 transitions. [2024-12-06 00:26:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 957 transitions. [2024-12-06 00:26:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 00:26:03,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:26:03,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:26:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 00:26:04,328 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 00:26:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 00:26:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 00:26:05,375 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 00:26:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 00:26:06,036 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 59 iterations. [2024-12-06 00:26:06,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 12:26:06 ImpRootNode [2024-12-06 00:26:06,117 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 00:26:06,118 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 00:26:06,118 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 00:26:06,118 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 00:26:06,119 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:21:35" (3/4) ... [2024-12-06 00:26:06,120 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 00:26:06,210 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 180. [2024-12-06 00:26:06,301 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 00:26:06,302 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 00:26:06,302 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 00:26:06,302 INFO L158 Benchmark]: Toolchain (without parser) took 272759.46ms. Allocated memory was 142.6MB in the beginning and 897.6MB in the end (delta: 755.0MB). Free memory was 116.4MB in the beginning and 575.0MB in the end (delta: -458.6MB). Peak memory consumption was 295.8MB. Max. memory is 16.1GB. [2024-12-06 00:26:06,302 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:26:06,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.68ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 99.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 00:26:06,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.62ms. Allocated memory is still 142.6MB. Free memory was 99.5MB 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 00:26:06,303 INFO L158 Benchmark]: Boogie Preprocessor took 34.68ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.0MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 00:26:06,304 INFO L158 Benchmark]: RCFGBuilder took 1132.15ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 103.5MB in the end (delta: -9.5MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2024-12-06 00:26:06,304 INFO L158 Benchmark]: CodeCheck took 271072.06ms. Allocated memory was 142.6MB in the beginning and 897.6MB in the end (delta: 755.0MB). Free memory was 103.5MB in the beginning and 595.9MB in the end (delta: -492.4MB). Peak memory consumption was 259.4MB. Max. memory is 16.1GB. [2024-12-06 00:26:06,304 INFO L158 Benchmark]: Witness Printer took 183.58ms. Allocated memory is still 897.6MB. Free memory was 595.9MB in the beginning and 575.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 00:26:06,306 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: 271.0s, OverallIterations: 59, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24283 SdHoareTripleChecker+Valid, 155.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22309 mSDsluCounter, 11321 SdHoareTripleChecker+Invalid, 141.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10373 mSDsCounter, 9901 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74171 IncrementalHoareTripleChecker+Invalid, 84072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9901 mSolverCounterUnsat, 948 mSDtfsCounter, 74171 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19402 GetRequests, 17221 SyntacticMatches, 911 SemanticMatches, 1270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066276 ImplicationChecksByTransitivity, 202.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 77.2s InterpolantComputationTime, 1772 NumberOfCodeBlocks, 1772 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 1666 ConstructedInterpolants, 0 QuantifiedInterpolants, 14767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 12 PerfectInterpolantSequences, 258/1097 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: 567]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L489] int c1 ; [L490] int i2 ; [L493] c1 = 0 [L494] ep12 = __VERIFIER_nondet_bool() [L495] ep13 = __VERIFIER_nondet_bool() [L496] ep21 = __VERIFIER_nondet_bool() [L497] ep23 = __VERIFIER_nondet_bool() [L498] ep31 = __VERIFIER_nondet_bool() [L499] ep32 = __VERIFIER_nondet_bool() [L500] id1 = __VERIFIER_nondet_char() [L501] r1 = __VERIFIER_nondet_uchar() [L502] st1 = __VERIFIER_nondet_char() [L503] nl1 = __VERIFIER_nondet_char() [L504] m1 = __VERIFIER_nondet_char() [L505] max1 = __VERIFIER_nondet_char() [L506] mode1 = __VERIFIER_nondet_bool() [L507] id2 = __VERIFIER_nondet_char() [L508] r2 = __VERIFIER_nondet_uchar() [L509] st2 = __VERIFIER_nondet_char() [L510] nl2 = __VERIFIER_nondet_char() [L511] m2 = __VERIFIER_nondet_char() [L512] max2 = __VERIFIER_nondet_char() [L513] mode2 = __VERIFIER_nondet_bool() [L514] id3 = __VERIFIER_nondet_char() [L515] r3 = __VERIFIER_nondet_uchar() [L516] st3 = __VERIFIER_nondet_char() [L517] nl3 = __VERIFIER_nondet_char() [L518] m3 = __VERIFIER_nondet_char() [L519] max3 = __VERIFIER_nondet_char() [L520] mode3 = __VERIFIER_nondet_bool() [L521] CALL, EXPR init() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND TRUE \read(r121) [L242] tmp = 1 [L253] r122 = (_Bool )tmp [L254] COND FALSE !(\read(r131)) [L257] COND TRUE \read(r121) [L258] COND TRUE \read(ep23) [L259] tmp___0 = 1 [L266] r132 = (_Bool )tmp___0 [L267] COND FALSE !(\read(r211)) [L270] COND TRUE \read(r231) [L271] COND TRUE \read(ep31) [L272] tmp___1 = 1 [L279] r212 = (_Bool )tmp___1 [L280] COND TRUE \read(r231) [L281] tmp___2 = 1 [L292] r232 = (_Bool )tmp___2 [L293] COND TRUE \read(r311) [L294] tmp___3 = 1 [L305] r312 = (_Bool )tmp___3 [L306] COND FALSE !(\read(r321)) [L309] COND TRUE \read(r311) [L310] COND TRUE \read(ep12) [L311] tmp___4 = 1 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE \read(r122) [L329] COND TRUE \read(r132) [L330] COND TRUE \read(r212) [L331] COND TRUE \read(r232) [L332] COND TRUE \read(r312) [L333] COND TRUE \read(r322) [L334] COND TRUE (int )max1 == (int )id1 [L335] COND TRUE (int )max2 == (int )id2 [L336] COND TRUE (int )max3 == (int )id3 [L337] COND TRUE (int )st1 == 0 [L338] COND TRUE (int )st2 == 0 [L339] COND TRUE (int )st3 == 0 [L340] COND TRUE (int )nl1 == 0 [L341] COND TRUE (int )nl2 == 0 [L342] COND TRUE (int )nl3 == 0 [L343] COND TRUE (int )mode1 == 0 [L344] COND TRUE (int )mode2 == 0 [L345] COND TRUE (int )mode3 == 0 [L346] tmp___5 = 1 [L428] return (tmp___5); [L521] RET, EXPR init() [L521] i2 = init() [L522] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L522] RET assume_abort_if_not(i2) [L523] p12_old = nomsg [L524] p12_new = nomsg [L525] p13_old = nomsg [L526] p13_new = nomsg [L527] p21_old = nomsg [L528] p21_new = nomsg [L529] p23_old = nomsg [L530] p23_new = nomsg [L531] p31_old = nomsg [L532] p31_new = nomsg [L533] p32_old = nomsg [L534] p32_new = nomsg [L535] i2 = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=125, m2=0, m3=0, max1=124, max2=126, max3=127, 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] [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 1 [L108] COND TRUE \read(ep12) [L109] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=125, m2=0, m3=0, max1=124, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=125, m2=0, m3=0, max1=124, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=125, m2=0, m3=0, max1=124, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=125, m2=0, m3=0, max1=124, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=125, m2=0, m3=0, max1=124, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=125, m2=0, m3=0, max1=124, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=125, m2=0, m3=0, max1=124, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=125, m2=0, m3=0, max1=124, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=125, m2=0, m3=0, max1=124, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=125, m2=0, m3=0, max1=124, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=125, m2=0, m3=0, max1=124, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=125, m2=0, m3=0, max1=124, max2=126, max3=127, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND TRUE (int )m1 > (int )max1 [L95] max1 = m1 [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND FALSE !((int )m2 > (int )max2) [L137] COND FALSE !(\read(ep32)) [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND FALSE !((int )r1 < 1) [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=124, m3=126, max1=127, max2=126, max3=127, 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=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND FALSE !((int )m1 > (int )max1) [L98] COND TRUE (int )r1 == 2 [L99] COND FALSE !((int )max1 == (int )id1) [L102] nl1 = (char)1 [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND FALSE !((int )m2 > (int )max2) [L137] COND FALSE !(\read(ep32)) [L144] COND TRUE (int )r2 == 2 [L145] COND TRUE (int )max2 == (int )id2 [L146] st2 = (char)1 [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=-1, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L436] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L482] tmp = 0 VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=-1, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=-1, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L567] reach_error() VAL [ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=124, id2=126, id3=127, m1=127, m2=-1, m3=126, max1=127, max2=126, max3=127, 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 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.68ms. Allocated memory is still 142.6MB. Free memory was 116.4MB in the beginning and 99.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.62ms. Allocated memory is still 142.6MB. Free memory was 99.5MB 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 34.68ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.0MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1132.15ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 103.5MB in the end (delta: -9.5MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * CodeCheck took 271072.06ms. Allocated memory was 142.6MB in the beginning and 897.6MB in the end (delta: 755.0MB). Free memory was 103.5MB in the beginning and 595.9MB in the end (delta: -492.4MB). Peak memory consumption was 259.4MB. Max. memory is 16.1GB. * Witness Printer took 183.58ms. Allocated memory is still 897.6MB. Free memory was 595.9MB in the beginning and 575.0MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 00:26:06,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1845f114-42bd-4b9a-8963-0b28e22dd5c4/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