./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 00:38:49,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:38:49,340 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:38:49,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:38:49,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:38:49,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:38:49,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:38:49,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:38:49,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:38:49,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:38:49,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:38:49,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:38:49,371 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:38:49,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:38:49,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:38:49,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:38:49,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:38:49,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:38:49,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:38:49,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:38:49,375 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:38:49,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:38:49,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:38:49,377 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:38:49,377 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:38:49,378 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:38:49,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:38:49,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:38:49,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:38:49,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:38:49,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:38:49,381 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:38:49,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:38:49,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 [2024-11-09 00:38:49,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:38:49,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:38:49,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:38:49,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:38:49,719 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:38:49,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-09 00:38:51,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:38:52,098 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:38:52,099 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2024-11-09 00:38:52,112 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/data/40b106b2a/cf2dbbd5ac3b4ba4a799898eb57e8290/FLAG2f9ac8ba8 [2024-11-09 00:38:52,421 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/data/40b106b2a/cf2dbbd5ac3b4ba4a799898eb57e8290 [2024-11-09 00:38:52,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:38:52,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:38:52,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:38:52,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:38:52,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:38:52,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:38:52" (1/1) ... [2024-11-09 00:38:52,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5349b8a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:38:52, skipping insertion in model container [2024-11-09 00:38:52,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:38:52" (1/1) ... [2024-11-09 00:38:52,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:38:52,929 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_61d07c5f-c510-4053-b5e4-b04eef1893c1/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2024-11-09 00:38:52,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:38:52,951 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:38:53,026 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_61d07c5f-c510-4053-b5e4-b04eef1893c1/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2024-11-09 00:38:53,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:38:53,049 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:38:53,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:38:53 WrapperNode [2024-11-09 00:38:53,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:38:53,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:38:53,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:38:53,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:38:53,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:38:53" (1/1) ... [2024-11-09 00:38:53,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:38:53" (1/1) ... [2024-11-09 00:38:53,129 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-11-09 00:38:53,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:38:53,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:38:53,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:38:53,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:38:53,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:38:53" (1/1) ... [2024-11-09 00:38:53,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:38:53" (1/1) ... [2024-11-09 00:38:53,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:38:53" (1/1) ... [2024-11-09 00:38:53,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:38:53" (1/1) ... [2024-11-09 00:38:53,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:38:53" (1/1) ... [2024-11-09 00:38:53,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:38:53" (1/1) ... [2024-11-09 00:38:53,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:38:53" (1/1) ... [2024-11-09 00:38:53,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:38:53" (1/1) ... [2024-11-09 00:38:53,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:38:53,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:38:53,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:38:53,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:38:53,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:38:53" (1/1) ... [2024-11-09 00:38:53,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:38:53,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:38:53,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:38:53,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:38:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:38:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:38:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:38:53,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:38:53,433 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:38:53,436 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:38:54,310 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-09 00:38:54,310 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:38:55,185 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:38:55,185 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:38:55,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:38:55 BoogieIcfgContainer [2024-11-09 00:38:55,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:38:55,188 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:38:55,188 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:38:55,200 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:38:55,201 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:38:55" (1/1) ... [2024-11-09 00:38:55,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:38:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-09 00:38:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-09 00:38:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 00:38:55,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:55,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:38:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:38:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:38:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-09 00:38:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-09 00:38:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 00:38:58,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:38:58,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:38:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-09 00:39:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-09 00:39:00,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 00:39:00,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:00,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-09 00:39:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-09 00:39:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:39:02,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:02,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-09 00:39:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-09 00:39:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 00:39:05,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:05,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 37 states and 65 transitions. [2024-11-09 00:39:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 65 transitions. [2024-11-09 00:39:07,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:39:07,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:07,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:09,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-11-09 00:39:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 43 states and 77 transitions. [2024-11-09 00:39:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2024-11-09 00:39:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:39:11,278 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:11,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 44 states and 77 transitions. [2024-11-09 00:39:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 77 transitions. [2024-11-09 00:39:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:39:11,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2024-11-09 00:39:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2024-11-09 00:39:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:39:12,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:12,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 55 states and 95 transitions. [2024-11-09 00:39:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 95 transitions. [2024-11-09 00:39:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:39:16,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:16,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 58 states and 101 transitions. [2024-11-09 00:39:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2024-11-09 00:39:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 00:39:17,091 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:17,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 74 states and 127 transitions. [2024-11-09 00:39:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 127 transitions. [2024-11-09 00:39:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 00:39:26,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 88 states and 152 transitions. [2024-11-09 00:39:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2024-11-09 00:39:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 00:39:32,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:32,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:38,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 96 states and 168 transitions. [2024-11-09 00:39:38,388 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2024-11-09 00:39:38,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 00:39:38,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:38,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 103 states and 192 transitions. [2024-11-09 00:39:44,579 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 192 transitions. [2024-11-09 00:39:44,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:39:44,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:44,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 117 states and 218 transitions. [2024-11-09 00:39:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 218 transitions. [2024-11-09 00:39:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:39:52,795 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 120 states and 230 transitions. [2024-11-09 00:39:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 230 transitions. [2024-11-09 00:39:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 00:39:56,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:56,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:39:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:39:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:39:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 121 states and 231 transitions. [2024-11-09 00:39:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 231 transitions. [2024-11-09 00:39:59,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 00:39:59,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:39:59,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:39:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:40:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 140 states and 260 transitions. [2024-11-09 00:40:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 260 transitions. [2024-11-09 00:40:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 00:40:10,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:10,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:40:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 145 states and 274 transitions. [2024-11-09 00:40:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 274 transitions. [2024-11-09 00:40:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 00:40:15,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:15,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:40:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 157 states and 302 transitions. [2024-11-09 00:40:25,648 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 302 transitions. [2024-11-09 00:40:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 00:40:25,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:25,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:26,747 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 00:40:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 156 states and 292 transitions. [2024-11-09 00:40:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 292 transitions. [2024-11-09 00:40:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 00:40:27,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:27,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:40:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 170 states and 338 transitions. [2024-11-09 00:40:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 338 transitions. [2024-11-09 00:40:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 00:40:40,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:40,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:40:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:40:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 179 states and 356 transitions. [2024-11-09 00:40:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 356 transitions. [2024-11-09 00:40:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 00:40:51,364 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:40:51,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:40:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:40:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 00:41:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 192 states and 379 transitions. [2024-11-09 00:41:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 379 transitions. [2024-11-09 00:41:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 00:41:02,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:02,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:41:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 202 states and 401 transitions. [2024-11-09 00:41:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 401 transitions. [2024-11-09 00:41:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 00:41:15,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:15,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 00:41:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 203 states and 405 transitions. [2024-11-09 00:41:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 405 transitions. [2024-11-09 00:41:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 00:41:18,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:18,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:41:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 218 states and 431 transitions. [2024-11-09 00:41:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 431 transitions. [2024-11-09 00:41:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 00:41:36,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:41:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 229 states and 453 transitions. [2024-11-09 00:41:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 453 transitions. [2024-11-09 00:41:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 00:41:49,122 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:49,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:41:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 230 states and 459 transitions. [2024-11-09 00:41:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 459 transitions. [2024-11-09 00:41:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 00:41:53,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:53,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:41:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:41:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:41:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 231 states and 461 transitions. [2024-11-09 00:41:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 461 transitions. [2024-11-09 00:41:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 00:41:59,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:41:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:41:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:42:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 233 states and 471 transitions. [2024-11-09 00:42:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 471 transitions. [2024-11-09 00:42:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 00:42:09,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:09,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:42:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 239 states and 484 transitions. [2024-11-09 00:42:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 484 transitions. [2024-11-09 00:42:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 00:42:26,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:26,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:42:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 241 states and 491 transitions. [2024-11-09 00:42:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 491 transitions. [2024-11-09 00:42:31,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 00:42:31,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:31,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:42:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:42:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 247 states and 505 transitions. [2024-11-09 00:42:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 505 transitions. [2024-11-09 00:42:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 00:42:46,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:42:46,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:42:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:42:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 256 states and 525 transitions. [2024-11-09 00:43:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 525 transitions. [2024-11-09 00:43:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 00:43:01,855 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:01,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 258 states and 529 transitions. [2024-11-09 00:43:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 529 transitions. [2024-11-09 00:43:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 00:43:07,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 259 states and 531 transitions. [2024-11-09 00:43:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 531 transitions. [2024-11-09 00:43:10,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 00:43:10,527 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:10,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 271 states and 562 transitions. [2024-11-09 00:43:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 562 transitions. [2024-11-09 00:43:31,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 00:43:31,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:31,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:36,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:36,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 272 states and 564 transitions. [2024-11-09 00:43:36,012 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 564 transitions. [2024-11-09 00:43:36,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 00:43:36,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 273 states and 578 transitions. [2024-11-09 00:43:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 578 transitions. [2024-11-09 00:43:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 00:43:41,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:41,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 274 states and 579 transitions. [2024-11-09 00:43:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 579 transitions. [2024-11-09 00:43:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 00:43:46,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:46,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:43:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:43:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 275 states and 579 transitions. [2024-11-09 00:43:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 579 transitions. [2024-11-09 00:43:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 00:43:50,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:43:50,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:43:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:43:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:44:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:44:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 291 states and 617 transitions. [2024-11-09 00:44:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 617 transitions. [2024-11-09 00:44:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 00:44:06,335 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:44:06,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:44:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:44:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:44:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:44:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 294 states and 626 transitions. [2024-11-09 00:44:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 626 transitions. [2024-11-09 00:44:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 00:44:11,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:44:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:44:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:44:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:44:14,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:44:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 295 states and 627 transitions. [2024-11-09 00:44:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 627 transitions. [2024-11-09 00:44:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 00:44:14,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:44:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:44:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:44:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:44:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:44:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 296 states and 630 transitions. [2024-11-09 00:44:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 630 transitions. [2024-11-09 00:44:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 00:44:18,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:44:18,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:44:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:44:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:44:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:44:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 303 states and 652 transitions. [2024-11-09 00:44:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 652 transitions. [2024-11-09 00:44:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 00:44:38,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:44:38,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:44:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:44:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:44:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:44:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 304 states and 653 transitions. [2024-11-09 00:44:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 653 transitions. [2024-11-09 00:44:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 00:44:46,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:44:46,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:44:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:44:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:44:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:44:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 310 states and 665 transitions. [2024-11-09 00:44:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 665 transitions. [2024-11-09 00:44:57,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 00:44:57,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:44:57,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:44:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:45:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:45:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:45:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 311 states and 666 transitions. [2024-11-09 00:45:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 666 transitions. [2024-11-09 00:45:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 00:45:04,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:45:04,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:45:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:45:05,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:45:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:45:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:45:08,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:45:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:45:09,041 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 51 iterations. [2024-11-09 00:45:09,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:45:09 ImpRootNode [2024-11-09 00:45:09,225 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:45:09,226 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:45:09,226 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:45:09,226 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:45:09,227 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:38:55" (3/4) ... [2024-11-09 00:45:09,227 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 00:45:09,384 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:45:09,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:45:09,385 INFO L158 Benchmark]: Toolchain (without parser) took 376958.73ms. Allocated memory was 169.9MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 141.2MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 548.6MB. Max. memory is 16.1GB. [2024-11-09 00:45:09,385 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 125.8MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:45:09,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.06ms. Allocated memory is still 169.9MB. Free memory was 141.2MB in the beginning and 125.6MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:45:09,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.45ms. Allocated memory is still 169.9MB. Free memory was 125.6MB in the beginning and 121.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:45:09,386 INFO L158 Benchmark]: Boogie Preprocessor took 53.85ms. Allocated memory is still 169.9MB. Free memory was 121.6MB in the beginning and 119.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:45:09,386 INFO L158 Benchmark]: RCFGBuilder took 2001.14ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 119.1MB in the beginning and 111.0MB in the end (delta: 8.2MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. [2024-11-09 00:45:09,386 INFO L158 Benchmark]: CodeCheck took 374037.70ms. Allocated memory was 205.5MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 111.0MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 464.0MB. Max. memory is 16.1GB. [2024-11-09 00:45:09,387 INFO L158 Benchmark]: Witness Printer took 158.26ms. Allocated memory is still 3.1GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:45:09,388 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: 373.8s, OverallIterations: 51, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21089 SdHoareTripleChecker+Valid, 183.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19356 mSDsluCounter, 5905 SdHoareTripleChecker+Invalid, 166.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5093 mSDsCounter, 7819 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57678 IncrementalHoareTripleChecker+Invalid, 65497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7819 mSolverCounterUnsat, 812 mSDtfsCounter, 57678 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14717 GetRequests, 12696 SyntacticMatches, 889 SemanticMatches, 1132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864361 ImplicationChecksByTransitivity, 245.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 143.7s InterpolantComputationTime, 1524 NumberOfCodeBlocks, 1524 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 1426 ConstructedInterpolants, 0 QuantifiedInterpolants, 15101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 11 PerfectInterpolantSequences, 191/953 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 609]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L563] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND TRUE \read(r121) [L269] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND TRUE \read(r121) [L285] COND TRUE \read(ep23) [L286] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND TRUE \read(r211) [L295] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND TRUE \read(r231) [L308] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND TRUE \read(r311) [L321] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND FALSE !(\read(r321)) [L336] COND TRUE \read(r311) [L337] COND TRUE \read(ep12) [L338] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=-2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND TRUE \read(newmax2) [L171] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=-2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=-2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=-2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=-2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=-2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=-2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=-2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=-2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=-2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=-2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=-2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=-2, m2=3, m3=-2, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND TRUE (int )m1 > (int )max1 [L92] max1 = m1 [L93] newmax = (_Bool)1 [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND TRUE (int )m3 > (int )max3 [L208] max3 = m3 [L209] newmax = (_Bool)1 [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND FALSE !(\read(newmax2)) [L174] COND TRUE \read(ep23) [L175] COND FALSE !(\read(newmax2)) [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=0, m2=1, m3=2, max1=2, max2=2, max3=2, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, 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=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND FALSE !((int )m1 > (int )max1) [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] st1 = (char)1 [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (char)1 [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND FALSE !((int )max3 == (int )id3) [L217] nl3 = (char)1 [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=2, m3=-1, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=2, m3=-1, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0, tmp=0] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=2, m3=-1, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L609] reach_error() VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=2, m3=-1, max1=2, max2=2, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 125.8MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.06ms. Allocated memory is still 169.9MB. Free memory was 141.2MB in the beginning and 125.6MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.45ms. Allocated memory is still 169.9MB. Free memory was 125.6MB in the beginning and 121.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.85ms. Allocated memory is still 169.9MB. Free memory was 121.6MB in the beginning and 119.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2001.14ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 119.1MB in the beginning and 111.0MB in the end (delta: 8.2MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. * CodeCheck took 374037.70ms. Allocated memory was 205.5MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 111.0MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 464.0MB. Max. memory is 16.1GB. * Witness Printer took 158.26ms. Allocated memory is still 3.1GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 00:45:09,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d07c5f-c510-4053-b5e4-b04eef1893c1/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE