./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/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_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/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_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/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 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:00:57,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:00:57,963 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 01:00:57,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:00:57,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 01:00:58,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:00:58,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:00:58,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 01:00:58,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:00:58,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:00:58,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:00:58,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:00:58,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:00:58,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:00:58,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:00:58,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:00:58,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:00:58,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:00:58,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:00:58,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:00:58,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:00:58,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:00:58,021 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:00:58,023 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 01:00:58,024 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 01:00:58,024 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 01:00:58,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:00:58,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 01:00:58,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:00:58,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:00:58,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:00:58,026 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 01:00:58,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:00:58,027 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_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/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_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2024-11-09 01:00:58,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:00:58,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:00:58,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:00:58,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:00:58,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:00:58,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c Unable to find full path for "g++" [2024-11-09 01:01:00,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:01:00,636 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:01:00,637 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2024-11-09 01:01:00,646 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/bin/ukojak-verify-ImItNfHLgk/data/8a08a8b71/2376cba2935c4cb5a40619c4c08307b2/FLAGef0f6ea72 [2024-11-09 01:01:01,004 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/bin/ukojak-verify-ImItNfHLgk/data/8a08a8b71/2376cba2935c4cb5a40619c4c08307b2 [2024-11-09 01:01:01,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:01:01,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:01:01,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:01:01,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:01:01,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:01:01,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:01:01" (1/1) ... [2024-11-09 01:01:01,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@660de1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:01:01, skipping insertion in model container [2024-11-09 01:01:01,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:01:01" (1/1) ... [2024-11-09 01:01:01,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:01:01,323 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_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2024-11-09 01:01:01,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:01:01,343 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:01:01,384 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_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2024-11-09 01:01:01,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:01:01,404 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:01:01,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:01:01 WrapperNode [2024-11-09 01:01:01,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:01:01,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:01:01,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:01:01,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:01:01,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:01:01" (1/1) ... [2024-11-09 01:01:01,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:01:01" (1/1) ... [2024-11-09 01:01:01,460 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 222 [2024-11-09 01:01:01,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:01:01,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:01:01,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:01:01,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:01:01,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:01:01" (1/1) ... [2024-11-09 01:01:01,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:01:01" (1/1) ... [2024-11-09 01:01:01,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:01:01" (1/1) ... [2024-11-09 01:01:01,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:01:01" (1/1) ... [2024-11-09 01:01:01,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:01:01" (1/1) ... [2024-11-09 01:01:01,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:01:01" (1/1) ... [2024-11-09 01:01:01,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:01:01" (1/1) ... [2024-11-09 01:01:01,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:01:01" (1/1) ... [2024-11-09 01:01:01,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:01:01,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:01:01,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:01:01,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:01:01,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:01:01" (1/1) ... [2024-11-09 01:01:01,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 01:01:01,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 01:01:01,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 01:01:01,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 01:01:01,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:01:01,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:01:01,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:01:01,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:01:01,657 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:01:01,659 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:01:02,079 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-09 01:01:02,079 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:01:02,439 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:01:02,439 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:01:02,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:01:02 BoogieIcfgContainer [2024-11-09 01:01:02,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:01:02,441 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 01:01:02,442 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 01:01:02,453 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 01:01:02,453 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:01:02" (1/1) ... [2024-11-09 01:01:02,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:01:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 12 states and 16 transitions. [2024-11-09 01:01:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2024-11-09 01:01:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 01:01:02,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:02,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:03,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 13 states and 18 transitions. [2024-11-09 01:01:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2024-11-09 01:01:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 01:01:03,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:03,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:04,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 17 states and 25 transitions. [2024-11-09 01:01:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2024-11-09 01:01:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 01:01:04,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:04,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 20 states and 30 transitions. [2024-11-09 01:01:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2024-11-09 01:01:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 01:01:05,634 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:05,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 23 states and 36 transitions. [2024-11-09 01:01:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 36 transitions. [2024-11-09 01:01:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 01:01:06,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:06,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2024-11-09 01:01:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2024-11-09 01:01:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 01:01:12,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:12,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 42 states and 70 transitions. [2024-11-09 01:01:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 70 transitions. [2024-11-09 01:01:18,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 01:01:18,836 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:18,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 50 states and 85 transitions. [2024-11-09 01:01:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 85 transitions. [2024-11-09 01:01:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 01:01:21,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:21,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 67 states and 124 transitions. [2024-11-09 01:01:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 124 transitions. [2024-11-09 01:01:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 01:01:28,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 69 states and 127 transitions. [2024-11-09 01:01:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 127 transitions. [2024-11-09 01:01:29,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 01:01:29,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:29,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 86 states and 160 transitions. [2024-11-09 01:01:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 160 transitions. [2024-11-09 01:01:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 01:01:37,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:37,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 94 states and 191 transitions. [2024-11-09 01:01:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 191 transitions. [2024-11-09 01:01:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 01:01:43,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:43,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 95 states and 193 transitions. [2024-11-09 01:01:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 193 transitions. [2024-11-09 01:01:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 01:01:46,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:46,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 97 states and 198 transitions. [2024-11-09 01:01:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 198 transitions. [2024-11-09 01:01:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 01:01:47,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:47,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:01:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:01:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 109 states and 225 transitions. [2024-11-09 01:01:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 225 transitions. [2024-11-09 01:01:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 01:01:56,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:01:56,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:01:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:01:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:02:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 115 states and 239 transitions. [2024-11-09 01:02:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 239 transitions. [2024-11-09 01:02:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 01:02:00,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:00,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 01:02:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 114 states and 225 transitions. [2024-11-09 01:02:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 225 transitions. [2024-11-09 01:02:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 01:02:01,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:01,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:02:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:02:53,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:02:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 140 states and 307 transitions. [2024-11-09 01:02:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 307 transitions. [2024-11-09 01:02:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 01:02:53,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:02:53,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:02:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:03:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 161 states and 359 transitions. [2024-11-09 01:03:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 359 transitions. [2024-11-09 01:03:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 01:03:42,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:42,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:03:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 171 states and 375 transitions. [2024-11-09 01:03:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 375 transitions. [2024-11-09 01:03:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 01:03:50,143 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:50,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:03:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:03:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 177 states and 383 transitions. [2024-11-09 01:03:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 383 transitions. [2024-11-09 01:03:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 01:03:56,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:03:56,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:03:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:03:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:04:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:04:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 182 states and 390 transitions. [2024-11-09 01:04:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 390 transitions. [2024-11-09 01:04:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 01:04:07,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:04:07,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:04:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:04:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:05:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:05:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 207 states and 444 transitions. [2024-11-09 01:05:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 444 transitions. [2024-11-09 01:05:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 01:05:18,062 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:05:18,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:05:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:05:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:06:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:06:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 232 states and 510 transitions. [2024-11-09 01:06:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 510 transitions. [2024-11-09 01:06:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 01:06:34,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:06:34,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:06:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:06:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:06:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:06:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 243 states and 537 transitions. [2024-11-09 01:06:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 537 transitions. [2024-11-09 01:06:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 01:06:59,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:06:59,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:06:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:07:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:07:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 258 states and 598 transitions. [2024-11-09 01:07:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 598 transitions. [2024-11-09 01:07:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 01:07:42,634 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:07:42,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:07:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:07:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 26 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:08:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:08:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 272 states and 650 transitions. [2024-11-09 01:08:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 650 transitions. [2024-11-09 01:08:23,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 01:08:23,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:08:23,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:08:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:08:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 278 states and 660 transitions. [2024-11-09 01:08:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 660 transitions. [2024-11-09 01:08:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 01:08:41,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:08:41,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:08:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:08:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 281 states and 670 transitions. [2024-11-09 01:08:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 670 transitions. [2024-11-09 01:08:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:08:46,565 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:08:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:08:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:08:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 01:09:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:09:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 289 states and 704 transitions. [2024-11-09 01:09:07,147 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 704 transitions. [2024-11-09 01:09:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:09:07,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:09:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:09:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:09:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 296 states and 719 transitions. [2024-11-09 01:09:26,083 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 719 transitions. [2024-11-09 01:09:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:09:26,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:09:26,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:09:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:09:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:10:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:10:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 309 states and 755 transitions. [2024-11-09 01:10:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 755 transitions. [2024-11-09 01:10:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:10:07,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:10:07,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:10:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:10:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 322 states and 800 transitions. [2024-11-09 01:10:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 800 transitions. [2024-11-09 01:10:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:10:28,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:10:28,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:10:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:10:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 329 states and 820 transitions. [2024-11-09 01:10:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 820 transitions. [2024-11-09 01:10:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:10:44,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:10:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:10:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:10:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:10:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 333 states and 832 transitions. [2024-11-09 01:10:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 832 transitions. [2024-11-09 01:10:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:10:57,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:10:57,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:10:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:11:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:11:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:11:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 340 states and 866 transitions. [2024-11-09 01:11:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 866 transitions. [2024-11-09 01:11:19,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:11:19,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:11:19,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:11:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:11:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:11:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:11:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 347 states and 896 transitions. [2024-11-09 01:11:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 896 transitions. [2024-11-09 01:11:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:11:35,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:11:35,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:11:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:11:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:11:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:11:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 348 states and 907 transitions. [2024-11-09 01:11:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 907 transitions. [2024-11-09 01:11:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:11:41,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:11:41,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:11:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:11:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:11:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:11:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 354 states and 920 transitions. [2024-11-09 01:11:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 920 transitions. [2024-11-09 01:11:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:11:59,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:11:59,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:11:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:12:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 01:12:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:12:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 356 states and 930 transitions. [2024-11-09 01:12:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 930 transitions. [2024-11-09 01:12:09,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:12:09,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:12:09,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:12:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:12:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:12:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:12:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 362 states and 946 transitions. [2024-11-09 01:12:34,087 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 946 transitions. [2024-11-09 01:12:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:12:34,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:12:34,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:12:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:12:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 26 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:12:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:12:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 368 states and 976 transitions. [2024-11-09 01:12:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 976 transitions. [2024-11-09 01:12:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:12:46,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:12:46,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:12:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:12:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:12:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:12:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 374 states and 989 transitions. [2024-11-09 01:12:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 989 transitions. [2024-11-09 01:12:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:12:59,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:12:59,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:12:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:13:00,165 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:13:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:13:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 381 states and 1007 transitions. [2024-11-09 01:13:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1007 transitions. [2024-11-09 01:13:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:13:12,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:13:12,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:13:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:13:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 01:13:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:13:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 382 states and 1018 transitions. [2024-11-09 01:13:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1018 transitions. [2024-11-09 01:13:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:13:16,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:13:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:13:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:13:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:13:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:13:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 386 states and 1025 transitions. [2024-11-09 01:13:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1025 transitions. [2024-11-09 01:13:28,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:13:28,698 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:13:28,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:13:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:13:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:14:04,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:14:04,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 399 states and 1061 transitions. [2024-11-09 01:14:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 1061 transitions. [2024-11-09 01:14:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:14:04,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:14:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:14:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:14:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:14:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:14:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 400 states and 1072 transitions. [2024-11-09 01:14:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1072 transitions. [2024-11-09 01:14:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:14:09,856 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:14:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:14:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:14:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 01:14:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:14:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 405 states and 1085 transitions. [2024-11-09 01:14:23,522 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 1085 transitions. [2024-11-09 01:14:23,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 01:14:23,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:14:23,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:14:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:14:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 01:14:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 01:14:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 406 states and 1086 transitions. [2024-11-09 01:14:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 1086 transitions. [2024-11-09 01:14:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 01:14:28,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 01:14:28,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:14:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:14:28,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:14:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:14:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:14:29,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:14:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:14:30,098 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 50 iterations. [2024-11-09 01:14:30,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 01:14:30 ImpRootNode [2024-11-09 01:14:30,227 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 01:14:30,228 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:14:30,230 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:14:30,231 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:14:30,231 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:01:02" (3/4) ... [2024-11-09 01:14:30,233 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 01:14:30,437 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 01:14:30,438 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:14:30,438 INFO L158 Benchmark]: Toolchain (without parser) took 809429.89ms. Allocated memory was 132.1MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 94.9MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 544.2MB. Max. memory is 16.1GB. [2024-11-09 01:14:30,439 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 132.1MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:14:30,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.24ms. Allocated memory is still 132.1MB. Free memory was 94.9MB in the beginning and 79.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:14:30,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.34ms. Allocated memory is still 132.1MB. Free memory was 79.3MB in the beginning and 77.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:14:30,440 INFO L158 Benchmark]: Boogie Preprocessor took 29.69ms. Allocated memory is still 132.1MB. Free memory was 77.1MB in the beginning and 75.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:14:30,441 INFO L158 Benchmark]: RCFGBuilder took 949.49ms. Allocated memory was 132.1MB in the beginning and 169.9MB in the end (delta: 37.7MB). Free memory was 75.6MB in the beginning and 105.3MB in the end (delta: -29.7MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2024-11-09 01:14:30,441 INFO L158 Benchmark]: CodeCheck took 807786.24ms. Allocated memory was 169.9MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 105.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 504.9MB. Max. memory is 16.1GB. [2024-11-09 01:14:30,442 INFO L158 Benchmark]: Witness Printer took 209.54ms. Allocated memory is still 2.7GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 01:14:30,444 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, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 807.6s, OverallIterations: 50, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21799 SdHoareTripleChecker+Valid, 260.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20794 mSDsluCounter, 17220 SdHoareTripleChecker+Invalid, 238.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16832 mSDsCounter, 12153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73201 IncrementalHoareTripleChecker+Invalid, 85354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12153 mSolverCounterUnsat, 388 mSDtfsCounter, 73201 mSolverCounterSat, 1.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20032 GetRequests, 17836 SyntacticMatches, 902 SemanticMatches, 1294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087668 ImplicationChecksByTransitivity, 702.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 133.4s InterpolantComputationTime, 1582 NumberOfCodeBlocks, 1582 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1487 ConstructedInterpolants, 0 QuantifiedInterpolants, 33301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 5 PerfectInterpolantSequences, 659/2286 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: 287]: 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] unsigned char r1 ; [L30] port_t p1 ; [L31] char p1_old ; [L32] char p1_new ; [L33] char id1 ; [L34] char st1 ; [L35] msg_t send1 ; [L36] _Bool mode1 ; [L37] port_t p2 ; [L38] char p2_old ; [L39] char p2_new ; [L40] char id2 ; [L41] char st2 ; [L42] msg_t send2 ; [L43] _Bool mode2 ; [L44] port_t p3 ; [L45] char p3_old ; [L46] char p3_new ; [L47] char id3 ; [L48] char st3 ; [L49] msg_t send3 ; [L50] _Bool mode3 ; [L235] int c1 ; [L236] int i2 ; [L239] c1 = 0 [L240] r1 = __VERIFIER_nondet_uchar() [L241] id1 = __VERIFIER_nondet_char() [L242] st1 = __VERIFIER_nondet_char() [L243] send1 = __VERIFIER_nondet_char() [L244] mode1 = __VERIFIER_nondet_bool() [L245] id2 = __VERIFIER_nondet_char() [L246] st2 = __VERIFIER_nondet_char() [L247] send2 = __VERIFIER_nondet_char() [L248] mode2 = __VERIFIER_nondet_bool() [L249] id3 = __VERIFIER_nondet_char() [L250] st3 = __VERIFIER_nondet_char() [L251] send3 = __VERIFIER_nondet_char() [L252] mode3 = __VERIFIER_nondet_bool() [L253] CALL, EXPR init() [L134] int tmp ; [L137] COND TRUE (int )r1 == 0 [L138] COND TRUE (int )id1 >= 0 [L139] COND TRUE (int )st1 == 0 [L140] COND TRUE (int )send1 == (int )id1 [L141] COND TRUE (int )mode1 == 0 [L142] COND TRUE (int )id2 >= 0 [L143] COND TRUE (int )st2 == 0 [L144] COND TRUE (int )send2 == (int )id2 [L145] COND TRUE (int )mode2 == 0 [L146] COND TRUE (int )id3 >= 0 [L147] COND TRUE (int )st3 == 0 [L148] COND TRUE (int )send3 == (int )id3 [L149] COND TRUE (int )mode3 == 0 [L150] COND TRUE (int )id1 != (int )id2 [L151] COND TRUE (int )id1 != (int )id3 [L152] COND TRUE (int )id2 != (int )id3 [L153] tmp = 1 [L202] return (tmp); [L253] RET, EXPR init() [L253] i2 = init() [L254] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L254] RET assume_abort_if_not(i2) [L255] p1_old = nomsg [L256] p1_new = nomsg [L257] p2_old = nomsg [L258] p2_new = nomsg [L259] p3_old = nomsg [L260] p3_new = nomsg [L261] i2 = 0 VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=0, r1=0, send1=2, send2=1, send3=0, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND FALSE !((int )m1 == (int )id1) [L71] send1 = m1 [L74] mode1 = (_Bool)0 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND TRUE (int )m2 > (int )id2 [L93] send2 = m2 [L99] mode2 = (_Bool)0 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND TRUE (int )m3 > (int )id3 [L118] send3 = m3 [L124] mode3 = (_Bool)0 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=0, send2=2, send3=1, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND FALSE !((int )m1 == (int )id1) [L71] send1 = m1 [L74] mode1 = (_Bool)0 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND FALSE !((int )m2 > (int )id2) [L95] COND FALSE !((int )m2 == (int )id2) [L99] mode2 = (_Bool)0 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND TRUE (int )m3 > (int )id3 [L118] send3 = m3 [L124] mode3 = (_Bool)0 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND FALSE !(\read(mode1)) [L76] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L77] mode1 = (_Bool)1 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND FALSE !(\read(mode2)) [L101] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L102] mode2 = (_Bool)1 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND FALSE !(\read(mode3)) [L126] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L127] mode3 = (_Bool)1 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L210] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L211] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L216] COND TRUE (int )r1 < 3 [L217] tmp = 1 VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0, tmp=1] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND FALSE !(! arg) VAL [id1=2, id2=1, id3=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=2, send3=2, st1=0, st2=0, st3=0] [L274] RET assert(c1) [L262] COND TRUE 1 [L264] CALL node1() [L53] msg_t m1 ; [L56] m1 = nomsg [L57] COND TRUE \read(mode1) [L58] COND FALSE !(r1 == 255) [L61] r1 = r1 + 1 [L62] m1 = p3_old [L63] p3_old = nomsg [L64] COND TRUE (int )m1 != (int )nomsg [L65] COND FALSE !((int )m1 > (int )id1) [L68] COND TRUE (int )m1 == (int )id1 [L69] st1 = (char)1 [L74] mode1 = (_Bool)0 [L264] RET node1() [L265] CALL node2() [L84] msg_t m2 ; [L87] m2 = nomsg [L88] COND TRUE \read(mode2) [L89] m2 = p1_old [L90] p1_old = nomsg [L91] COND TRUE (int )m2 != (int )nomsg [L92] COND FALSE !((int )m2 > (int )id2) [L95] COND TRUE (int )m2 == (int )id2 [L96] st2 = (char)1 [L99] mode2 = (_Bool)0 [L265] RET node2() [L266] CALL node3() [L109] msg_t m3 ; [L112] m3 = nomsg [L113] COND TRUE \read(mode3) [L114] m3 = p2_old [L115] p2_old = nomsg [L116] COND TRUE (int )m3 != (int )nomsg [L117] COND TRUE (int )m3 > (int )id3 [L118] send3 = m3 [L124] mode3 = (_Bool)0 [L266] RET node3() [L267] p1_old = p1_new [L268] p1_new = nomsg [L269] p2_old = p2_new [L270] p2_new = nomsg [L271] p3_old = p3_new [L272] p3_new = nomsg [L273] CALL, EXPR check() [L207] int tmp ; VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L210] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L228] tmp = 0 VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0, tmp=0] [L230] return (tmp); [L273] RET, EXPR check() [L273] c1 = check() [L274] CALL assert(c1) [L285] COND TRUE ! arg VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] [L287] reach_error() VAL [id1=2, id2=1, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=2, send3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 132.1MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.24ms. Allocated memory is still 132.1MB. Free memory was 94.9MB in the beginning and 79.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.34ms. Allocated memory is still 132.1MB. Free memory was 79.3MB in the beginning and 77.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.69ms. Allocated memory is still 132.1MB. Free memory was 77.1MB in the beginning and 75.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 949.49ms. Allocated memory was 132.1MB in the beginning and 169.9MB in the end (delta: 37.7MB). Free memory was 75.6MB in the beginning and 105.3MB in the end (delta: -29.7MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * CodeCheck took 807786.24ms. Allocated memory was 169.9MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 105.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 504.9MB. Max. memory is 16.1GB. * Witness Printer took 209.54ms. Allocated memory is still 2.7GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 01:14:30,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16d91fc4-8916-44e6-a1ef-05ce0e6e9564/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