./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/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_ebf4ba79-c619-410e-8233-63d6ec6b87d4/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/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_ebf4ba79-c619-410e-8233-63d6ec6b87d4/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 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 22:49:12,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:49:12,167 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 22:49:12,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:49:12,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:49:12,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:49:12,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:49:12,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 22:49:12,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:49:12,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:49:12,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:49:12,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:49:12,199 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:49:12,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:49:12,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:49:12,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:49:12,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:49:12,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:49:12,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:49:12,202 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:49:12,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:49:12,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:49:12,203 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:49:12,204 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:49:12,204 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:49:12,205 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:49:12,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:49:12,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:49:12,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:49:12,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:49:12,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:49:12,207 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:49:12,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:49:12,208 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_ebf4ba79-c619-410e-8233-63d6ec6b87d4/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_ebf4ba79-c619-410e-8233-63d6ec6b87d4/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 -> 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c [2024-11-08 22:49:12,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:49:12,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:49:12,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:49:12,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:49:12,493 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:49:12,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-08 22:49:14,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:49:14,860 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:49:14,861 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2024-11-08 22:49:14,872 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/bin/ukojak-verify-ImItNfHLgk/data/c4db3d0a3/91813fac916c42fea3e2407acc8849ab/FLAG51d3131ad [2024-11-08 22:49:14,894 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/bin/ukojak-verify-ImItNfHLgk/data/c4db3d0a3/91813fac916c42fea3e2407acc8849ab [2024-11-08 22:49:14,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:49:14,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:49:14,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:49:14,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:49:14,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:49:14,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:49:14" (1/1) ... [2024-11-08 22:49:14,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33aa9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:49:14, skipping insertion in model container [2024-11-08 22:49:14,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:49:14" (1/1) ... [2024-11-08 22:49:14,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:49:15,252 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_ebf4ba79-c619-410e-8233-63d6ec6b87d4/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2024-11-08 22:49:15,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:49:15,282 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:49:15,360 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_ebf4ba79-c619-410e-8233-63d6ec6b87d4/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2024-11-08 22:49:15,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:49:15,380 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:49:15,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:49:15 WrapperNode [2024-11-08 22:49:15,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:49:15,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:49:15,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:49:15,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:49:15,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:49:15" (1/1) ... [2024-11-08 22:49:15,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:49:15" (1/1) ... [2024-11-08 22:49:15,468 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-11-08 22:49:15,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:49:15,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:49:15,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:49:15,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:49:15,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:49:15" (1/1) ... [2024-11-08 22:49:15,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:49:15" (1/1) ... [2024-11-08 22:49:15,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:49:15" (1/1) ... [2024-11-08 22:49:15,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:49:15" (1/1) ... [2024-11-08 22:49:15,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:49:15" (1/1) ... [2024-11-08 22:49:15,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:49:15" (1/1) ... [2024-11-08 22:49:15,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:49:15" (1/1) ... [2024-11-08 22:49:15,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:49:15" (1/1) ... [2024-11-08 22:49:15,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:49:15,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:49:15,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:49:15,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:49:15,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:49:15" (1/1) ... [2024-11-08 22:49:15,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:49:15,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:49:15,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:49:15,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:49:15,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:49:15,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 22:49:15,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:49:15,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:49:15,759 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:49:15,761 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:49:16,569 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-08 22:49:16,569 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:49:17,403 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:49:17,403 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:49:17,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:49:17 BoogieIcfgContainer [2024-11-08 22:49:17,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:49:17,405 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:49:17,406 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:49:17,416 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:49:17,416 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:49:17" (1/1) ... [2024-11-08 22:49:17,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:49:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-08 22:49:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-08 22:49:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 22:49:17,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-08 22:49:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-08 22:49:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 22:49:20,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:20,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-08 22:49:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-08 22:49:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 22:49:22,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-08 22:49:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-08 22:49:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 22:49:24,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:24,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-08 22:49:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-08 22:49:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 22:49:26,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:26,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 37 states and 65 transitions. [2024-11-08 22:49:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 65 transitions. [2024-11-08 22:49:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 22:49:28,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:28,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 43 states and 77 transitions. [2024-11-08 22:49:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2024-11-08 22:49:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 22:49:31,824 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:31,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 44 states and 77 transitions. [2024-11-08 22:49:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 77 transitions. [2024-11-08 22:49:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:49:32,412 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:32,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2024-11-08 22:49:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2024-11-08 22:49:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:49:32,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:32,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 55 states and 95 transitions. [2024-11-08 22:49:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 95 transitions. [2024-11-08 22:49:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 22:49:36,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:36,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:38,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 58 states and 100 transitions. [2024-11-08 22:49:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2024-11-08 22:49:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 22:49:38,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:38,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 74 states and 127 transitions. [2024-11-08 22:49:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 127 transitions. [2024-11-08 22:49:46,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:49:46,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:46,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 88 states and 151 transitions. [2024-11-08 22:49:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 151 transitions. [2024-11-08 22:49:51,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:49:51,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:51,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:49:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:49:56,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 102 states and 173 transitions. [2024-11-08 22:49:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 173 transitions. [2024-11-08 22:49:56,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:49:56,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:49:56,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:49:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:49:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:50:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:50:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 108 states and 190 transitions. [2024-11-08 22:50:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 190 transitions. [2024-11-08 22:50:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:50:00,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:50:00,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:50:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:50:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 109 states and 192 transitions. [2024-11-08 22:50:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 192 transitions. [2024-11-08 22:50:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:50:02,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:50:02,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:50:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:50:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 123 states and 216 transitions. [2024-11-08 22:50:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 216 transitions. [2024-11-08 22:50:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:50:07,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:50:07,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:50:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:50:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 126 states and 227 transitions. [2024-11-08 22:50:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 227 transitions. [2024-11-08 22:50:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:50:10,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:50:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:50:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:50:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 130 states and 249 transitions. [2024-11-08 22:50:16,451 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 249 transitions. [2024-11-08 22:50:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 22:50:16,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:50:16,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:50:24,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:50:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 149 states and 277 transitions. [2024-11-08 22:50:24,233 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 277 transitions. [2024-11-08 22:50:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:50:24,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:50:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:50:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:50:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 154 states and 290 transitions. [2024-11-08 22:50:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 290 transitions. [2024-11-08 22:50:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:50:28,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:50:28,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:50:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:50:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 159 states and 300 transitions. [2024-11-08 22:50:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 300 transitions. [2024-11-08 22:50:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 22:50:34,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:50:34,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:50:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:50:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 173 states and 345 transitions. [2024-11-08 22:50:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 345 transitions. [2024-11-08 22:50:46,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 22:50:46,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:50:46,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:50:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:50:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 184 states and 362 transitions. [2024-11-08 22:50:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 362 transitions. [2024-11-08 22:50:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 22:50:54,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:50:54,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:56,176 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-08 22:50:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:50:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 187 states and 371 transitions. [2024-11-08 22:50:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 371 transitions. [2024-11-08 22:50:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 22:50:58,290 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:50:58,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:51:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:51:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:51:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 202 states and 407 transitions. [2024-11-08 22:51:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 407 transitions. [2024-11-08 22:51:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 22:51:09,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:51:09,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:51:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:51:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:51:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:51:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 203 states and 409 transitions. [2024-11-08 22:51:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 409 transitions. [2024-11-08 22:51:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 22:51:11,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:51:11,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:51:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:51:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:51:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:51:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 213 states and 430 transitions. [2024-11-08 22:51:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 430 transitions. [2024-11-08 22:51:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 22:51:20,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:51:20,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:51:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:51:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:51:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:51:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 214 states and 433 transitions. [2024-11-08 22:51:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 433 transitions. [2024-11-08 22:51:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 22:51:22,202 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:51:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:51:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:51:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:51:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:51:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 216 states and 436 transitions. [2024-11-08 22:51:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 436 transitions. [2024-11-08 22:51:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 22:51:25,511 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:51:25,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:51:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:51:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:51:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:51:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 217 states and 442 transitions. [2024-11-08 22:51:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 442 transitions. [2024-11-08 22:51:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 22:51:28,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:51:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:51:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:51:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:51:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:51:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 225 states and 469 transitions. [2024-11-08 22:51:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 469 transitions. [2024-11-08 22:51:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 22:51:39,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:51:39,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:51:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:51:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:51:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:51:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 227 states and 480 transitions. [2024-11-08 22:51:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 480 transitions. [2024-11-08 22:51:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 22:51:43,804 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:51:43,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:51:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:51:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:51:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:51:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 230 states and 498 transitions. [2024-11-08 22:51:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 498 transitions. [2024-11-08 22:51:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 22:51:51,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:51:51,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:51:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:51:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:51:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:51:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 231 states and 500 transitions. [2024-11-08 22:51:55,209 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 500 transitions. [2024-11-08 22:51:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 22:51:55,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:51:55,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:51:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:52:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:52:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 243 states and 527 transitions. [2024-11-08 22:52:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 527 transitions. [2024-11-08 22:52:12,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:52:12,485 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:52:12,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:52:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:52:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 258 states and 575 transitions. [2024-11-08 22:52:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 575 transitions. [2024-11-08 22:52:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:52:30,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:52:30,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:52:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:52:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 261 states and 596 transitions. [2024-11-08 22:52:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 596 transitions. [2024-11-08 22:52:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:52:37,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:52:37,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:52:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:52:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 265 states and 613 transitions. [2024-11-08 22:52:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 613 transitions. [2024-11-08 22:52:45,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:52:45,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:52:45,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:52:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:52:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 266 states and 618 transitions. [2024-11-08 22:52:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 618 transitions. [2024-11-08 22:52:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:52:48,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:52:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:52:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:52:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 268 states and 628 transitions. [2024-11-08 22:52:52,987 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 628 transitions. [2024-11-08 22:52:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:52:52,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:52:52,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:52:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:52:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 269 states and 631 transitions. [2024-11-08 22:52:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 631 transitions. [2024-11-08 22:52:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:52:56,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:52:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:53:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:53:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 270 states and 637 transitions. [2024-11-08 22:53:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 637 transitions. [2024-11-08 22:53:00,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:53:00,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:53:00,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:53:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:53:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 271 states and 644 transitions. [2024-11-08 22:53:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 644 transitions. [2024-11-08 22:53:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 22:53:04,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:53:04,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:53:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:53:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 274 states and 653 transitions. [2024-11-08 22:53:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 653 transitions. [2024-11-08 22:53:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:53:09,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:53:09,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:53:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:53:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 285 states and 685 transitions. [2024-11-08 22:53:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 685 transitions. [2024-11-08 22:53:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:53:30,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:53:30,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:53:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:53:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 290 states and 707 transitions. [2024-11-08 22:53:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 707 transitions. [2024-11-08 22:53:38,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:53:38,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:53:38,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:53:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:53:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 296 states and 719 transitions. [2024-11-08 22:53:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 719 transitions. [2024-11-08 22:53:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:53:51,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:53:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:54:00,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:54:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 298 states and 730 transitions. [2024-11-08 22:54:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 730 transitions. [2024-11-08 22:54:00,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:54:00,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:54:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:54:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:54:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 305 states and 749 transitions. [2024-11-08 22:54:12,010 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 749 transitions. [2024-11-08 22:54:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:54:12,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:54:12,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:54:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:54:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 307 states and 752 transitions. [2024-11-08 22:54:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 752 transitions. [2024-11-08 22:54:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:54:22,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:54:22,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:54:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:54:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 309 states and 757 transitions. [2024-11-08 22:54:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 757 transitions. [2024-11-08 22:54:27,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:54:27,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:54:27,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:54:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:54:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 312 states and 767 transitions. [2024-11-08 22:54:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 767 transitions. [2024-11-08 22:54:33,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:54:33,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:54:33,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:54:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:54:37,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 313 states and 772 transitions. [2024-11-08 22:54:37,971 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 772 transitions. [2024-11-08 22:54:37,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:54:37,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:54:37,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:54:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:54:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 314 states and 776 transitions. [2024-11-08 22:54:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 776 transitions. [2024-11-08 22:54:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 22:54:45,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:54:45,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:54:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:54:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 315 states and 779 transitions. [2024-11-08 22:54:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 779 transitions. [2024-11-08 22:54:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 22:54:51,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:54:51,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 22:54:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:54:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 316 states and 781 transitions. [2024-11-08 22:54:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 781 transitions. [2024-11-08 22:54:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 22:54:54,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:54:54,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 22:54:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:54:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 316 states and 780 transitions. [2024-11-08 22:54:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 780 transitions. [2024-11-08 22:54:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 22:54:57,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:54:57,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:54:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:54:58,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:54:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:55:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:55:00,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:55:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:55:00,820 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 58 iterations. [2024-11-08 22:55:00,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 10:55:00 ImpRootNode [2024-11-08 22:55:00,962 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 22:55:00,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:55:00,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:55:00,963 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:55:00,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:49:17" (3/4) ... [2024-11-08 22:55:00,965 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 22:55:01,127 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 22:55:01,127 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:55:01,128 INFO L158 Benchmark]: Toolchain (without parser) took 346229.97ms. Allocated memory was 144.7MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 105.6MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 926.7MB. Max. memory is 16.1GB. [2024-11-08 22:55:01,128 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 144.7MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:55:01,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.33ms. Allocated memory is still 144.7MB. Free memory was 105.6MB in the beginning and 86.0MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 22:55:01,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.75ms. Allocated memory is still 144.7MB. Free memory was 85.6MB in the beginning and 82.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:55:01,129 INFO L158 Benchmark]: Boogie Preprocessor took 75.09ms. Allocated memory is still 144.7MB. Free memory was 82.2MB in the beginning and 79.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:55:01,129 INFO L158 Benchmark]: RCFGBuilder took 1859.17ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 79.4MB in the beginning and 113.5MB in the end (delta: -34.1MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2024-11-08 22:55:01,129 INFO L158 Benchmark]: CodeCheck took 343556.64ms. Allocated memory was 186.6MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 113.5MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 872.4MB. Max. memory is 16.1GB. [2024-11-08 22:55:01,130 INFO L158 Benchmark]: Witness Printer took 164.61ms. Allocated memory is still 3.6GB. Free memory was 2.7GB in the beginning and 2.6GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 22:55:01,132 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: 343.4s, OverallIterations: 58, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26745 SdHoareTripleChecker+Valid, 201.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24752 mSDsluCounter, 7844 SdHoareTripleChecker+Invalid, 182.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6913 mSDsCounter, 8849 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73544 IncrementalHoareTripleChecker+Invalid, 82393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8849 mSolverCounterUnsat, 931 mSDtfsCounter, 73544 mSolverCounterSat, 1.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17502 GetRequests, 15373 SyntacticMatches, 999 SemanticMatches, 1130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876612 ImplicationChecksByTransitivity, 218.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 8.5s SatisfiabilityAnalysisTime, 127.0s InterpolantComputationTime, 1839 NumberOfCodeBlocks, 1839 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1734 ConstructedInterpolants, 0 QuantifiedInterpolants, 15753 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 57 InterpolantComputations, 12 PerfectInterpolantSequences, 292/1258 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 FALSE !(\read(r121)) [L271] COND TRUE \read(r131) [L272] COND TRUE \read(ep32) [L273] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND TRUE \read(r131) [L282] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND TRUE \read(r211) [L295] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND FALSE !(\read(r231)) [L310] COND TRUE \read(r211) [L311] COND TRUE \read(ep13) [L312] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND TRUE \read(r321) [L324] COND TRUE \read(ep21) [L325] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND TRUE \read(r321) [L334] 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=127, m2=3, m3=-2, max1=0, max2=2, max3=1, 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=256, 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 < 1 [L115] COND FALSE !(\read(ep12)) [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [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 FALSE !(\read(ep23)) [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 FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND TRUE \read(newmax3) [L230] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=127, m2=3, m3=-2, max1=0, max2=2, max3=1, 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=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=256, r3=256, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=127, m2=3, m3=-2, max1=0, max2=2, max3=1, 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=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=256, r3=256, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=127, m2=3, m3=-2, max1=0, max2=2, max3=1, 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=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=256, r3=256, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=127, m2=3, m3=-2, max1=0, max2=2, max3=1, 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=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=256, r3=256, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=127, m2=3, m3=-2, max1=0, max2=2, max3=1, 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=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=256, r3=256, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=127, m2=3, m3=-2, max1=0, max2=2, max3=1, 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=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=256, r3=256, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=127, m2=3, m3=-2, max1=0, max2=2, max3=1, 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=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=256, r3=256, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=127, m2=3, m3=-2, max1=0, max2=2, max3=1, 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=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=256, r3=256, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=127, m2=3, m3=-2, max1=0, max2=2, max3=1, 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=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=256, r3=256, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=127, m2=3, m3=-2, max1=0, max2=2, max3=1, 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=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=256, r3=256, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=127, m2=3, m3=-2, max1=0, max2=2, max3=1, 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=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=256, r3=256, 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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=127, m2=3, m3=-2, max1=0, max2=2, max3=1, 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=0, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=256, r3=256, 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 FALSE !(\read(ep31)) [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 FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [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 TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND FALSE !(\read(ep23)) [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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [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 FALSE !((int )r1 < 1) [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 FALSE !(\read(ep23)) [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 FALSE !(\read(ep31)) [L228] COND TRUE \read(ep32) [L229] COND FALSE !(\read(newmax3)) [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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=2, m2=1, m3=0, max1=2, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [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 FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] nl1 = (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 FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [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 TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [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=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=-1, m2=-1, m3=-1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=-1, m2=-1, m3=-1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=-1, m2=-1, m3=-1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L609] reach_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=0, id2=2, id3=1, m1=-1, m2=-1, m3=-1, max1=2, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 144.7MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.33ms. Allocated memory is still 144.7MB. Free memory was 105.6MB in the beginning and 86.0MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.75ms. Allocated memory is still 144.7MB. Free memory was 85.6MB in the beginning and 82.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.09ms. Allocated memory is still 144.7MB. Free memory was 82.2MB in the beginning and 79.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1859.17ms. Allocated memory was 144.7MB in the beginning and 186.6MB in the end (delta: 41.9MB). Free memory was 79.4MB in the beginning and 113.5MB in the end (delta: -34.1MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. * CodeCheck took 343556.64ms. Allocated memory was 186.6MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 113.5MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 872.4MB. Max. memory is 16.1GB. * Witness Printer took 164.61ms. Allocated memory is still 3.6GB. Free memory was 2.7GB in the beginning and 2.6GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 22:55:01,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ebf4ba79-c619-410e-8233-63d6ec6b87d4/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