./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/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_c5032c74-08d5-43eb-9e2d-96cb87e78b47/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/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_c5032c74-08d5-43eb-9e2d-96cb87e78b47/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 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:49:16,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:49:16,449 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:49:16,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:49:16,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:49:16,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:49:16,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:49:16,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:49:16,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:49:16,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:49:16,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:49:16,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:49:16,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:49:16,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:49:16,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:49:16,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:49:16,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:49:16,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:49:16,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:49:16,512 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:49:16,512 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:49:16,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:49:16,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:49:16,518 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:49:16,518 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:49:16,519 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:49:16,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:49:16,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:49:16,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:49:16,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:49:16,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:49:16,521 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:49:16,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:49:16,521 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_c5032c74-08d5-43eb-9e2d-96cb87e78b47/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_c5032c74-08d5-43eb-9e2d-96cb87e78b47/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 -> 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 [2024-11-08 23:49:16,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:49:16,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:49:16,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:49:16,877 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:49:16,877 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:49:16,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-08 23:49:18,907 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:49:19,183 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:49:19,183 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-11-08 23:49:19,195 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/bin/ukojak-verify-ImItNfHLgk/data/4c8ab2c5d/4871b227dbe34ee891da54fb0a271b27/FLAGaba4d62ea [2024-11-08 23:49:19,211 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/bin/ukojak-verify-ImItNfHLgk/data/4c8ab2c5d/4871b227dbe34ee891da54fb0a271b27 [2024-11-08 23:49:19,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:49:19,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:49:19,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:49:19,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:49:19,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:49:19,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:49:19" (1/1) ... [2024-11-08 23:49:19,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b68a9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:19, skipping insertion in model container [2024-11-08 23:49:19,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:49:19" (1/1) ... [2024-11-08 23:49:19,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:49:19,608 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_c5032c74-08d5-43eb-9e2d-96cb87e78b47/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2024-11-08 23:49:19,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:49:19,626 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:49:19,707 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_c5032c74-08d5-43eb-9e2d-96cb87e78b47/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2024-11-08 23:49:19,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:49:19,742 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:49:19,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:19 WrapperNode [2024-11-08 23:49:19,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:49:19,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:49:19,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:49:19,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:49:19,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:19" (1/1) ... [2024-11-08 23:49:19,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:19" (1/1) ... [2024-11-08 23:49:19,815 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 441 [2024-11-08 23:49:19,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:49:19,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:49:19,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:49:19,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:49:19,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:19" (1/1) ... [2024-11-08 23:49:19,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:19" (1/1) ... [2024-11-08 23:49:19,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:19" (1/1) ... [2024-11-08 23:49:19,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:19" (1/1) ... [2024-11-08 23:49:19,846 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:19" (1/1) ... [2024-11-08 23:49:19,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:19" (1/1) ... [2024-11-08 23:49:19,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:19" (1/1) ... [2024-11-08 23:49:19,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:19" (1/1) ... [2024-11-08 23:49:19,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:49:19,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:49:19,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:49:19,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:49:19,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:49:19" (1/1) ... [2024-11-08 23:49:19,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:49:19,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:49:19,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:49:19,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:49:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:49:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:49:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:49:19,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:49:20,126 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:49:20,128 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:49:20,913 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-08 23:49:20,914 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:49:21,658 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:49:21,658 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:49:21,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:49:21 BoogieIcfgContainer [2024-11-08 23:49:21,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:49:21,660 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:49:21,660 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:49:21,672 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:49:21,673 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:49:21" (1/1) ... [2024-11-08 23:49:21,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:49:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-11-08 23:49:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-11-08 23:49:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 23:49:21,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:21,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:24,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-11-08 23:49:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-11-08 23:49:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:49:24,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:24,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-11-08 23:49:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-11-08 23:49:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:49:25,549 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:25,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-11-08 23:49:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-11-08 23:49:27,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:49:27,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:27,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-11-08 23:49:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-11-08 23:49:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 23:49:29,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:29,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:31,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-11-08 23:49:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-11-08 23:49:31,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:49:31,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-11-08 23:49:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-11-08 23:49:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:49:33,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:33,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-11-08 23:49:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-11-08 23:49:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:49:34,527 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:34,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2024-11-08 23:49:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2024-11-08 23:49:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:49:34,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:34,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2024-11-08 23:49:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2024-11-08 23:49:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:49:38,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:38,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2024-11-08 23:49:38,880 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2024-11-08 23:49:38,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 23:49:38,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:38,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 76 states and 130 transitions. [2024-11-08 23:49:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2024-11-08 23:49:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 23:49:46,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:46,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 89 states and 156 transitions. [2024-11-08 23:49:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 156 transitions. [2024-11-08 23:49:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 23:49:49,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:49,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 101 states and 178 transitions. [2024-11-08 23:49:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 178 transitions. [2024-11-08 23:49:53,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:49:53,717 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:53,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:49:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:49:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 109 states and 203 transitions. [2024-11-08 23:49:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 203 transitions. [2024-11-08 23:49:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:49:58,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:49:58,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:49:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:49:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:50:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:50:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 111 states and 208 transitions. [2024-11-08 23:50:00,981 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 208 transitions. [2024-11-08 23:50:00,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:50:00,982 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:50:00,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:50:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:50:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 113 states and 214 transitions. [2024-11-08 23:50:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 214 transitions. [2024-11-08 23:50:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:50:03,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:50:03,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:05,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:50:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:50:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 122 states and 239 transitions. [2024-11-08 23:50:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 239 transitions. [2024-11-08 23:50:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:50:08,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:50:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:50:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:50:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 124 states and 243 transitions. [2024-11-08 23:50:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 243 transitions. [2024-11-08 23:50:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:50:11,247 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:50:11,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:50:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:50:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 130 states and 262 transitions. [2024-11-08 23:50:17,598 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 262 transitions. [2024-11-08 23:50:17,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:50:17,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:50:17,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:50:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:50:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 132 states and 269 transitions. [2024-11-08 23:50:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 269 transitions. [2024-11-08 23:50:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:50:20,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:50:20,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:50:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:50:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 134 states and 281 transitions. [2024-11-08 23:50:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 281 transitions. [2024-11-08 23:50:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:50:23,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:50:23,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:50:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:50:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 153 states and 313 transitions. [2024-11-08 23:50:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 313 transitions. [2024-11-08 23:50:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:50:33,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:50:33,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:50:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:50:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 157 states and 327 transitions. [2024-11-08 23:50:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 327 transitions. [2024-11-08 23:50:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 23:50:38,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:50:38,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:50:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:50:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 162 states and 341 transitions. [2024-11-08 23:50:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 341 transitions. [2024-11-08 23:50:41,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 23:50:41,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:50:41,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:50:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:50:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 165 states and 348 transitions. [2024-11-08 23:50:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 348 transitions. [2024-11-08 23:50:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 23:50:44,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:50:44,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:50:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:50:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 166 states and 351 transitions. [2024-11-08 23:50:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 351 transitions. [2024-11-08 23:50:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 23:50:46,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:50:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:50:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:50:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 178 states and 375 transitions. [2024-11-08 23:50:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 375 transitions. [2024-11-08 23:50:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 23:50:56,827 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:50:56,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:50:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:50:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:51:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:51:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 176 states and 363 transitions. [2024-11-08 23:51:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 363 transitions. [2024-11-08 23:51:00,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 23:51:00,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:51:00,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:51:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:51:03,580 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:51:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:51:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 193 states and 419 transitions. [2024-11-08 23:51:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 419 transitions. [2024-11-08 23:51:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 23:51:15,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:51:15,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:51:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:51:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:51:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:51:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 207 states and 475 transitions. [2024-11-08 23:51:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 475 transitions. [2024-11-08 23:51:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 23:51:31,064 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:51:31,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:51:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:51:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:51:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:51:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 221 states and 507 transitions. [2024-11-08 23:51:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 507 transitions. [2024-11-08 23:51:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 23:51:44,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:51:44,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:51:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:51:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:51:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:51:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 231 states and 526 transitions. [2024-11-08 23:51:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 526 transitions. [2024-11-08 23:51:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 23:51:54,303 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:51:54,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:51:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:51:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:52:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:52:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 241 states and 542 transitions. [2024-11-08 23:52:04,490 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 542 transitions. [2024-11-08 23:52:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:52:04,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:52:04,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:52:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:52:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:52:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 252 states and 570 transitions. [2024-11-08 23:52:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 570 transitions. [2024-11-08 23:52:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:52:21,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:52:21,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:52:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:52:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:52:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 261 states and 592 transitions. [2024-11-08 23:52:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 592 transitions. [2024-11-08 23:52:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:52:30,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:52:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:52:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:52:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:52:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 263 states and 608 transitions. [2024-11-08 23:52:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 608 transitions. [2024-11-08 23:52:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:52:40,383 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:52:40,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:52:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:52:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:52:46,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 265 states and 613 transitions. [2024-11-08 23:52:46,178 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 613 transitions. [2024-11-08 23:52:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:52:46,179 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:52:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:52:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:52:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:52:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:52:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 271 states and 635 transitions. [2024-11-08 23:52:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 635 transitions. [2024-11-08 23:52:59,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 23:52:59,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:52:59,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:52:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:53:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:53:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:53:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 272 states and 636 transitions. [2024-11-08 23:53:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 636 transitions. [2024-11-08 23:53:02,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:53:02,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:53:02,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:53:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:53:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:53:09,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:53:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 276 states and 641 transitions. [2024-11-08 23:53:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 641 transitions. [2024-11-08 23:53:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:53:09,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:53:09,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:53:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:53:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:53:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:53:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 286 states and 664 transitions. [2024-11-08 23:53:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 664 transitions. [2024-11-08 23:53:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:53:28,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:53:28,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:53:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:53:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:53:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:53:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 298 states and 687 transitions. [2024-11-08 23:53:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 687 transitions. [2024-11-08 23:53:49,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:53:49,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:53:49,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:53:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:53:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:53:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:53:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 300 states and 698 transitions. [2024-11-08 23:53:59,096 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 698 transitions. [2024-11-08 23:53:59,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:53:59,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:53:59,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:53:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:00,904 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:54:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:54:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 301 states and 699 transitions. [2024-11-08 23:54:01,985 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 699 transitions. [2024-11-08 23:54:01,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:54:01,986 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:54:01,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:54:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:54:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:54:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 302 states and 707 transitions. [2024-11-08 23:54:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 707 transitions. [2024-11-08 23:54:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:54:05,385 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:54:05,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:54:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:54:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:54:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 309 states and 728 transitions. [2024-11-08 23:54:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 728 transitions. [2024-11-08 23:54:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:54:24,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:54:24,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:54:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:54:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:54:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 317 states and 764 transitions. [2024-11-08 23:54:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 764 transitions. [2024-11-08 23:54:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:54:45,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:54:45,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:54:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:54:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:54:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 321 states and 781 transitions. [2024-11-08 23:54:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 781 transitions. [2024-11-08 23:54:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:54:54,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:54:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:54:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:54:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:55:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:55:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 325 states and 792 transitions. [2024-11-08 23:55:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 792 transitions. [2024-11-08 23:55:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:55:02,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:55:02,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:55:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:55:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:55:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 326 states and 794 transitions. [2024-11-08 23:55:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 794 transitions. [2024-11-08 23:55:06,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:55:06,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:55:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:55:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:55:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:55:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 337 states and 822 transitions. [2024-11-08 23:55:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 822 transitions. [2024-11-08 23:55:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:55:24,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:55:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:55:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:55:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:55:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 338 states and 825 transitions. [2024-11-08 23:55:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 825 transitions. [2024-11-08 23:55:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:55:27,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:55:27,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:55:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:55:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:55:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 343 states and 841 transitions. [2024-11-08 23:55:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 841 transitions. [2024-11-08 23:55:35,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:55:35,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:55:35,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:55:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:55:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:55:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 352 states and 858 transitions. [2024-11-08 23:55:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 858 transitions. [2024-11-08 23:55:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:55:52,054 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:55:52,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:55:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:55:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:56:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:56:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 354 states and 865 transitions. [2024-11-08 23:56:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 865 transitions. [2024-11-08 23:56:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:56:00,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:56:00,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:56:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:56:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 358 states and 884 transitions. [2024-11-08 23:56:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 884 transitions. [2024-11-08 23:56:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:56:08,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:56:08,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:56:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:56:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 360 states and 888 transitions. [2024-11-08 23:56:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 888 transitions. [2024-11-08 23:56:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:56:13,301 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:56:13,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:56:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:56:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 362 states and 891 transitions. [2024-11-08 23:56:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 891 transitions. [2024-11-08 23:56:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:56:21,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:56:21,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:56:35,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:56:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 368 states and 922 transitions. [2024-11-08 23:56:35,854 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 922 transitions. [2024-11-08 23:56:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:56:35,855 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:56:35,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:56:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:56:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 373 states and 946 transitions. [2024-11-08 23:56:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 946 transitions. [2024-11-08 23:56:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:56:47,827 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:56:47,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:56:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:56:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 375 states and 951 transitions. [2024-11-08 23:56:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 951 transitions. [2024-11-08 23:56:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:56:53,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:56:53,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:56:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:56:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 376 states and 954 transitions. [2024-11-08 23:56:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 954 transitions. [2024-11-08 23:56:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 23:56:57,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:56:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:56:58,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:56:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:56:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:56:59,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:56:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:56:59,894 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 63 iterations. [2024-11-08 23:57:00,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:57:00 ImpRootNode [2024-11-08 23:57:00,077 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:57:00,078 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:57:00,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:57:00,078 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:57:00,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:49:21" (3/4) ... [2024-11-08 23:57:00,080 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 23:57:00,272 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:57:00,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:57:00,273 INFO L158 Benchmark]: Toolchain (without parser) took 461056.92ms. Allocated memory was 142.6MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 109.4MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 579.1MB. Max. memory is 16.1GB. [2024-11-08 23:57:00,274 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 113.6MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:57:00,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.86ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 90.5MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:57:00,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.47ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:57:00,275 INFO L158 Benchmark]: Boogie Preprocessor took 47.55ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 84.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:57:00,275 INFO L158 Benchmark]: RCFGBuilder took 1790.51ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 84.4MB in the beginning and 89.8MB in the end (delta: -5.4MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2024-11-08 23:57:00,275 INFO L158 Benchmark]: CodeCheck took 458416.68ms. Allocated memory was 184.5MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 89.8MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 499.7MB. Max. memory is 16.1GB. [2024-11-08 23:57:00,276 INFO L158 Benchmark]: Witness Printer took 194.67ms. Allocated memory is still 5.3GB. Free memory was 4.7GB in the beginning and 4.7GB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:57:00,279 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: 458.2s, OverallIterations: 63, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32147 SdHoareTripleChecker+Valid, 247.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30029 mSDsluCounter, 10208 SdHoareTripleChecker+Invalid, 222.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9192 mSDsCounter, 13217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94382 IncrementalHoareTripleChecker+Invalid, 107599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13217 mSolverCounterUnsat, 1016 mSDtfsCounter, 94382 mSolverCounterSat, 1.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19302 GetRequests, 16789 SyntacticMatches, 1083 SemanticMatches, 1430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304725 ImplicationChecksByTransitivity, 347.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 136.3s InterpolantComputationTime, 1878 NumberOfCodeBlocks, 1878 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 16759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 62 InterpolantComputations, 10 PerfectInterpolantSequences, 201/1151 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: 543]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L465] int c1 ; [L466] int i2 ; [L469] c1 = 0 [L470] ep12 = __VERIFIER_nondet_bool() [L471] ep13 = __VERIFIER_nondet_bool() [L472] ep21 = __VERIFIER_nondet_bool() [L473] ep23 = __VERIFIER_nondet_bool() [L474] ep31 = __VERIFIER_nondet_bool() [L475] ep32 = __VERIFIER_nondet_bool() [L476] id1 = __VERIFIER_nondet_char() [L477] r1 = __VERIFIER_nondet_uchar() [L478] st1 = __VERIFIER_nondet_char() [L479] nl1 = __VERIFIER_nondet_char() [L480] m1 = __VERIFIER_nondet_char() [L481] max1 = __VERIFIER_nondet_char() [L482] mode1 = __VERIFIER_nondet_bool() [L483] id2 = __VERIFIER_nondet_char() [L484] r2 = __VERIFIER_nondet_uchar() [L485] st2 = __VERIFIER_nondet_char() [L486] nl2 = __VERIFIER_nondet_char() [L487] m2 = __VERIFIER_nondet_char() [L488] max2 = __VERIFIER_nondet_char() [L489] mode2 = __VERIFIER_nondet_bool() [L490] id3 = __VERIFIER_nondet_char() [L491] r3 = __VERIFIER_nondet_uchar() [L492] st3 = __VERIFIER_nondet_char() [L493] nl3 = __VERIFIER_nondet_char() [L494] m3 = __VERIFIER_nondet_char() [L495] max3 = __VERIFIER_nondet_char() [L496] mode3 = __VERIFIER_nondet_bool() [L497] CALL, EXPR init() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND FALSE !(\read(r121)) [L244] COND FALSE !(\read(r131)) [L251] tmp = 0 [L253] r122 = (_Bool )tmp [L254] COND FALSE !(\read(r131)) [L257] COND FALSE !(\read(r121)) [L264] tmp___0 = 0 [L266] r132 = (_Bool )tmp___0 [L267] COND FALSE !(\read(r211)) [L270] COND FALSE !(\read(r231)) [L277] tmp___1 = 0 [L279] r212 = (_Bool )tmp___1 [L280] COND FALSE !(\read(r231)) [L283] COND FALSE !(\read(r211)) [L290] tmp___2 = 0 [L292] r232 = (_Bool )tmp___2 [L293] COND FALSE !(\read(r311)) [L296] COND FALSE !(\read(r321)) [L303] tmp___3 = 0 [L305] r312 = (_Bool )tmp___3 [L306] COND FALSE !(\read(r321)) [L309] COND FALSE !(\read(r311)) [L316] tmp___4 = 0 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE (int )max1 == (int )id1 [L329] COND TRUE (int )max2 == (int )id2 [L330] COND TRUE (int )max3 == (int )id3 [L331] COND TRUE (int )st1 == 0 [L332] COND TRUE (int )st2 == 0 [L333] COND TRUE (int )st3 == 0 [L334] COND TRUE (int )nl1 == 0 [L335] COND TRUE (int )nl2 == 0 [L336] COND TRUE (int )nl3 == 0 [L337] COND TRUE (int )mode1 == 0 [L338] COND TRUE (int )mode2 == 0 [L339] COND TRUE (int )mode3 == 0 [L340] tmp___5 = 1 [L404] return (tmp___5); [L497] RET, EXPR init() [L497] i2 = init() [L498] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L498] RET assume_abort_if_not(i2) [L499] p12_old = nomsg [L500] p12_new = nomsg [L501] p13_old = nomsg [L502] p13_new = nomsg [L503] p21_old = nomsg [L504] p21_new = nomsg [L505] p23_old = nomsg [L506] p23_new = nomsg [L507] p31_old = nomsg [L508] p31_new = nomsg [L509] p32_old = nomsg [L510] p32_new = nomsg [L511] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND TRUE 1 [L514] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L514] RET node1() [L515] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L515] RET node2() [L516] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND FALSE !(\read(ep31)) [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L530] RET assert(c1) [L512] COND TRUE 1 [L514] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND FALSE !(\read(ep31)) [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L514] RET node1() [L515] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [L137] COND FALSE !(\read(ep32)) [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L515] RET node2() [L516] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND FALSE !(\read(ep23)) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L530] RET assert(c1) [L512] COND TRUE 1 [L514] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L514] RET node1() [L515] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND FALSE !(\read(ep23)) [L161] mode2 = (_Bool)1 [L515] RET node2() [L516] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND FALSE !(\read(ep31)) [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L421] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-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] [L530] RET assert(c1) [L512] COND TRUE 1 [L514] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND FALSE !(\read(ep31)) [L98] COND TRUE (int )r1 == 2 [L99] COND TRUE (int )max1 == (int )id1 [L100] st1 = (char)1 [L105] mode1 = (_Bool)0 [L514] RET node1() [L515] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [L137] COND FALSE !(\read(ep32)) [L144] COND TRUE (int )r2 == 2 [L145] COND TRUE (int )max2 == (int )id2 [L146] st2 = (char)1 [L151] mode2 = (_Bool)0 [L515] RET node2() [L516] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND FALSE !(\read(ep23)) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L412] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L458] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1, tmp=0] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L543] reach_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=-2, m3=127, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 113.6MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.86ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 90.5MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.47ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.55ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 84.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1790.51ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 84.4MB in the beginning and 89.8MB in the end (delta: -5.4MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. * CodeCheck took 458416.68ms. Allocated memory was 184.5MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 89.8MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 499.7MB. Max. memory is 16.1GB. * Witness Printer took 194.67ms. Allocated memory is still 5.3GB. Free memory was 4.7GB in the beginning and 4.7GB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 23:57:00,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5032c74-08d5-43eb-9e2d-96cb87e78b47/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