./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9 --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 cfaa727818e9d1eb335a3637dac175808db4c2bbb7c5a7c3c9835dd5611700d7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 21:59:01,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 21:59:01,720 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-02 21:59:01,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 21:59:01,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-02 21:59:01,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 21:59:01,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 21:59:01,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-02 21:59:01,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 21:59:01,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 21:59:01,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 21:59:01,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 21:59:01,752 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 21:59:01,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 21:59:01,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 21:59:01,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 21:59:01,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 21:59:01,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 21:59:01,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 21:59:01,756 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 21:59:01,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 21:59:01,757 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 21:59:01,757 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-02 21:59:01,758 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-02 21:59:01,758 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-02 21:59:01,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 21:59:01,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 21:59:01,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 21:59:01,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 21:59:01,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 21:59:01,761 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-02 21:59:01,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 21:59:01,762 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 21:59:01,762 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_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/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_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9 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 -> cfaa727818e9d1eb335a3637dac175808db4c2bbb7c5a7c3c9835dd5611700d7 [2023-12-02 21:59:01,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 21:59:01,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 21:59:01,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 21:59:01,996 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 21:59:01,996 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 21:59:01,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c [2023-12-02 21:59:04,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 21:59:05,288 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 21:59:05,289 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c [2023-12-02 21:59:05,338 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/data/0ec8d3e0a/bd4dd39e12314242aa58b970ed302aad/FLAG83f8c23b4 [2023-12-02 21:59:05,353 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/data/0ec8d3e0a/bd4dd39e12314242aa58b970ed302aad [2023-12-02 21:59:05,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 21:59:05,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 21:59:05,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 21:59:05,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 21:59:05,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 21:59:05,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:59:05" (1/1) ... [2023-12-02 21:59:05,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f60860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:59:05, skipping insertion in model container [2023-12-02 21:59:05,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:59:05" (1/1) ... [2023-12-02 21:59:05,639 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 21:59:07,621 WARN L240 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_089409df-c37f-4c9a-afa5-117f0a4b1b47/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[378560,378573] [2023-12-02 21:59:07,650 WARN L240 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_089409df-c37f-4c9a-afa5-117f0a4b1b47/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[383339,383352] [2023-12-02 21:59:07,778 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 21:59:07,789 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 21:59:08,757 WARN L240 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_089409df-c37f-4c9a-afa5-117f0a4b1b47/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[378560,378573] [2023-12-02 21:59:08,765 WARN L240 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_089409df-c37f-4c9a-afa5-117f0a4b1b47/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[383339,383352] [2023-12-02 21:59:08,773 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 21:59:08,849 INFO L206 MainTranslator]: Completed translation [2023-12-02 21:59:08,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:59:08 WrapperNode [2023-12-02 21:59:08,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 21:59:08,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 21:59:08,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 21:59:08,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 21:59:08,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:59:08" (1/1) ... [2023-12-02 21:59:08,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:59:08" (1/1) ... [2023-12-02 21:59:09,218 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12574 [2023-12-02 21:59:09,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 21:59:09,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 21:59:09,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 21:59:09,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 21:59:09,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:59:08" (1/1) ... [2023-12-02 21:59:09,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:59:08" (1/1) ... [2023-12-02 21:59:09,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:59:08" (1/1) ... [2023-12-02 21:59:09,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:59:08" (1/1) ... [2023-12-02 21:59:09,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:59:08" (1/1) ... [2023-12-02 21:59:09,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:59:08" (1/1) ... [2023-12-02 21:59:09,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:59:08" (1/1) ... [2023-12-02 21:59:09,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:59:08" (1/1) ... [2023-12-02 21:59:09,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 21:59:09,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 21:59:09,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 21:59:09,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 21:59:09,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:59:08" (1/1) ... [2023-12-02 21:59:09,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 21:59:09,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-02 21:59:09,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-02 21:59:09,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-02 21:59:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 21:59:09,791 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-02 21:59:09,792 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-02 21:59:09,792 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-02 21:59:09,792 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-02 21:59:09,792 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-02 21:59:09,792 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-02 21:59:09,793 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-02 21:59:09,793 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-02 21:59:09,793 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-02 21:59:09,793 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-02 21:59:09,793 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-02 21:59:09,793 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-02 21:59:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 21:59:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-02 21:59:09,794 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-02 21:59:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 21:59:09,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 21:59:09,893 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 21:59:09,896 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 21:59:17,481 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 21:59:19,063 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 21:59:19,064 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-02 21:59:19,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:59:19 BoogieIcfgContainer [2023-12-02 21:59:19,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 21:59:19,067 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-02 21:59:19,067 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-02 21:59:19,075 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-02 21:59:19,075 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:59:19" (1/1) ... [2023-12-02 21:59:19,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 21:59:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 1718 states and 3379 transitions. [2023-12-02 21:59:19,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 3379 transitions. [2023-12-02 21:59:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 21:59:19,174 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:19,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:59:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1722 states and 3385 transitions. [2023-12-02 21:59:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3385 transitions. [2023-12-02 21:59:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 21:59:19,551 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:19,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:59:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1723 states and 3385 transitions. [2023-12-02 21:59:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 3385 transitions. [2023-12-02 21:59:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 21:59:19,663 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:19,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 21:59:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 1731 states and 3399 transitions. [2023-12-02 21:59:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3399 transitions. [2023-12-02 21:59:19,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 21:59:19,759 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:19,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 21:59:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 1744 states and 3426 transitions. [2023-12-02 21:59:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3426 transitions. [2023-12-02 21:59:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 21:59:20,378 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:20,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 21:59:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 1747 states and 3431 transitions. [2023-12-02 21:59:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 3431 transitions. [2023-12-02 21:59:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 21:59:20,910 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:20,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 21:59:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 1745 states and 3426 transitions. [2023-12-02 21:59:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3426 transitions. [2023-12-02 21:59:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 21:59:21,030 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:21,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 21:59:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 1742 states and 3418 transitions. [2023-12-02 21:59:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3418 transitions. [2023-12-02 21:59:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 21:59:21,117 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 21:59:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 1755 states and 3445 transitions. [2023-12-02 21:59:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3445 transitions. [2023-12-02 21:59:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 21:59:22,547 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:22,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 21:59:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 1757 states and 3451 transitions. [2023-12-02 21:59:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3451 transitions. [2023-12-02 21:59:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 21:59:22,950 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 21:59:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 1754 states and 3442 transitions. [2023-12-02 21:59:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3442 transitions. [2023-12-02 21:59:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 21:59:23,032 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:23,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 21:59:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 1758 states and 3448 transitions. [2023-12-02 21:59:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3448 transitions. [2023-12-02 21:59:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 21:59:23,166 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 21:59:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1758 states and 3447 transitions. [2023-12-02 21:59:23,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3447 transitions. [2023-12-02 21:59:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 21:59:23,204 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:23,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 21:59:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 1760 states and 3451 transitions. [2023-12-02 21:59:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 3451 transitions. [2023-12-02 21:59:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 21:59:23,253 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:23,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 21:59:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 1771 states and 3469 transitions. [2023-12-02 21:59:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 3469 transitions. [2023-12-02 21:59:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 21:59:23,812 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 21:59:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 1775 states and 3476 transitions. [2023-12-02 21:59:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3476 transitions. [2023-12-02 21:59:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 21:59:24,161 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-02 21:59:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 1777 states and 3479 transitions. [2023-12-02 21:59:24,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 3479 transitions. [2023-12-02 21:59:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-02 21:59:24,310 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 21:59:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 1778 states and 3480 transitions. [2023-12-02 21:59:24,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 3480 transitions. [2023-12-02 21:59:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 21:59:24,445 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:24,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 21:59:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 1780 states and 3482 transitions. [2023-12-02 21:59:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 3482 transitions. [2023-12-02 21:59:24,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 21:59:24,580 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:24,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 21:59:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 1784 states and 3490 transitions. [2023-12-02 21:59:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 3490 transitions. [2023-12-02 21:59:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 21:59:24,705 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:24,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 21:59:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 1791 states and 3506 transitions. [2023-12-02 21:59:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3506 transitions. [2023-12-02 21:59:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 21:59:25,269 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:25,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:25,411 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 21:59:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 1798 states and 3527 transitions. [2023-12-02 21:59:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3527 transitions. [2023-12-02 21:59:26,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-02 21:59:26,329 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:26,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 21:59:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 1800 states and 3532 transitions. [2023-12-02 21:59:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 3532 transitions. [2023-12-02 21:59:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 21:59:26,891 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:26,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 21:59:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 1798 states and 3526 transitions. [2023-12-02 21:59:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3526 transitions. [2023-12-02 21:59:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 21:59:26,978 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:26,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 21:59:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 1794 states and 3515 transitions. [2023-12-02 21:59:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3515 transitions. [2023-12-02 21:59:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 21:59:27,069 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:27,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 21:59:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 1795 states and 3515 transitions. [2023-12-02 21:59:27,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3515 transitions. [2023-12-02 21:59:27,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 21:59:27,152 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:27,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 21:59:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1804 states and 3531 transitions. [2023-12-02 21:59:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 3531 transitions. [2023-12-02 21:59:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-02 21:59:27,864 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:27,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 21:59:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 1806 states and 3535 transitions. [2023-12-02 21:59:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 3535 transitions. [2023-12-02 21:59:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-02 21:59:27,937 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 21:59:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 1811 states and 3546 transitions. [2023-12-02 21:59:28,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 3546 transitions. [2023-12-02 21:59:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-02 21:59:28,800 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:28,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 21:59:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 1815 states and 3552 transitions. [2023-12-02 21:59:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 3552 transitions. [2023-12-02 21:59:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 21:59:29,252 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:29,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-02 21:59:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 1817 states and 3554 transitions. [2023-12-02 21:59:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 3554 transitions. [2023-12-02 21:59:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-02 21:59:29,662 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:29,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-02 21:59:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 1822 states and 3563 transitions. [2023-12-02 21:59:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 3563 transitions. [2023-12-02 21:59:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-02 21:59:29,753 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:29,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 21:59:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 1822 states and 3562 transitions. [2023-12-02 21:59:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 3562 transitions. [2023-12-02 21:59:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-02 21:59:30,692 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:30,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 21:59:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 1824 states and 3563 transitions. [2023-12-02 21:59:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 3563 transitions. [2023-12-02 21:59:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 21:59:30,925 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 21:59:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 1841 states and 3598 transitions. [2023-12-02 21:59:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 3598 transitions. [2023-12-02 21:59:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 21:59:32,261 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:32,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 21:59:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 1845 states and 3604 transitions. [2023-12-02 21:59:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 3604 transitions. [2023-12-02 21:59:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 21:59:32,796 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:32,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 21:59:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 1851 states and 3614 transitions. [2023-12-02 21:59:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 3614 transitions. [2023-12-02 21:59:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 21:59:33,080 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:33,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 21:59:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 1857 states and 3625 transitions. [2023-12-02 21:59:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 3625 transitions. [2023-12-02 21:59:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 21:59:33,172 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 21:59:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 1859 states and 3628 transitions. [2023-12-02 21:59:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 3628 transitions. [2023-12-02 21:59:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 21:59:33,492 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:33,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 21:59:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 1864 states and 3637 transitions. [2023-12-02 21:59:33,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 3637 transitions. [2023-12-02 21:59:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 21:59:33,690 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 21:59:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 1868 states and 3643 transitions. [2023-12-02 21:59:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 3643 transitions. [2023-12-02 21:59:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 21:59:34,176 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-02 21:59:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3725 states to 1878 states and 3663 transitions. [2023-12-02 21:59:35,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 3663 transitions. [2023-12-02 21:59:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 21:59:35,313 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:35,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-02 21:59:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3787 states to 1898 states and 3720 transitions. [2023-12-02 21:59:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 3720 transitions. [2023-12-02 21:59:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-02 21:59:37,782 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:37,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 21:59:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3808 states to 1908 states and 3741 transitions. [2023-12-02 21:59:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 3741 transitions. [2023-12-02 21:59:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-02 21:59:38,939 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:38,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 21:59:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 1914 states and 3757 transitions. [2023-12-02 21:59:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 3757 transitions. [2023-12-02 21:59:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-02 21:59:39,313 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:39,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-02 21:59:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 1916 states and 3761 transitions. [2023-12-02 21:59:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 3761 transitions. [2023-12-02 21:59:39,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-02 21:59:39,881 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:39,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 21:59:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-02 21:59:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 21:59:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 1916 states and 3761 transitions. [2023-12-02 21:59:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 3761 transitions. [2023-12-02 21:59:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-02 21:59:39,953 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 21:59:39,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 21:59:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 21:59:39,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 21:59:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 21:59:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 21:59:40,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 21:59:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 21:59:40,226 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 47 iterations. [2023-12-02 21:59:40,293 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 21:59:40,297 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 21:59:40,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 21:59:40,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 09:59:40 ImpRootNode [2023-12-02 21:59:40,325 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-02 21:59:40,325 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 21:59:40,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 21:59:40,326 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 21:59:40,326 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:59:19" (3/4) ... [2023-12-02 21:59:40,327 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 21:59:40,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 21:59:40,347 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 21:59:40,353 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-02 21:59:40,430 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-02 21:59:40,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 21:59:40,431 INFO L158 Benchmark]: Toolchain (without parser) took 35074.63ms. Allocated memory was 163.6MB in the beginning and 964.7MB in the end (delta: 801.1MB). Free memory was 82.8MB in the beginning and 250.5MB in the end (delta: -167.7MB). Peak memory consumption was 634.0MB. Max. memory is 16.1GB. [2023-12-02 21:59:40,432 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 107.0MB. Free memory is still 60.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 21:59:40,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3492.14ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 82.8MB in the beginning and 82.2MB in the end (delta: 641.9kB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2023-12-02 21:59:40,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 367.48ms. Allocated memory is still 230.7MB. Free memory was 82.2MB in the beginning and 67.7MB in the end (delta: 14.5MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2023-12-02 21:59:40,433 INFO L158 Benchmark]: Boogie Preprocessor took 504.28ms. Allocated memory was 230.7MB in the beginning and 306.2MB in the end (delta: 75.5MB). Free memory was 67.7MB in the beginning and 132.4MB in the end (delta: -64.7MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2023-12-02 21:59:40,433 INFO L158 Benchmark]: RCFGBuilder took 9342.05ms. Allocated memory was 306.2MB in the beginning and 738.2MB in the end (delta: 432.0MB). Free memory was 132.4MB in the beginning and 493.4MB in the end (delta: -361.0MB). Peak memory consumption was 411.8MB. Max. memory is 16.1GB. [2023-12-02 21:59:40,434 INFO L158 Benchmark]: CodeCheck took 21257.69ms. Allocated memory was 738.2MB in the beginning and 964.7MB in the end (delta: 226.5MB). Free memory was 493.4MB in the beginning and 263.1MB in the end (delta: 230.3MB). Peak memory consumption was 455.8MB. Max. memory is 16.1GB. [2023-12-02 21:59:40,434 INFO L158 Benchmark]: Witness Printer took 105.54ms. Allocated memory is still 964.7MB. Free memory was 263.1MB in the beginning and 250.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 21:59:40,436 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 8 procedures, 1718 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 47, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17879 SdHoareTripleChecker+Valid, 26.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10541 mSDsluCounter, 25481 SdHoareTripleChecker+Invalid, 22.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16406 mSDsCounter, 5945 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21357 IncrementalHoareTripleChecker+Invalid, 27302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5945 mSolverCounterUnsat, 9075 mSDtfsCounter, 21357 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28379 GetRequests, 27856 SyntacticMatches, 173 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57638 ImplicationChecksByTransitivity, 15.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 3027 NumberOfCodeBlocks, 3027 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2884 ConstructedInterpolants, 0 QuantifiedInterpolants, 4997 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 37 PerfectInterpolantSequences, 1096/1141 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) [L11429] COND FALSE !(T1_E == 0) [L11434] COND FALSE !(E_M == 0) [L11439] COND FALSE !(E_1 == 0) [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) [L11457] COND FALSE !(T1_E == 1) [L11462] COND FALSE !(E_M == 1) [L11467] COND FALSE !(E_1 == 1) [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11385-L11396] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE, EXPR \read(tmp_ndt_2) [L11404] EXPR t1_st = 1 [L11405] CALL, EXPR transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET, EXPR transmit1() [L11399-L11410] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE, EXPR \read(tmp_ndt_1) [L11390] EXPR m_st = 1 [L11391] CALL, EXPR master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET, EXPR master() [L11385-L11396] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE, EXPR \read(tmp_ndt_2) [L11404] EXPR t1_st = 1 [L11405] CALL, EXPR transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET, EXPR transmit1() [L11399-L11410] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) [L11227] COND TRUE tmp_var <= 5 [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 107.0MB. Free memory is still 60.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3492.14ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 82.8MB in the beginning and 82.2MB in the end (delta: 641.9kB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 367.48ms. Allocated memory is still 230.7MB. Free memory was 82.2MB in the beginning and 67.7MB in the end (delta: 14.5MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 504.28ms. Allocated memory was 230.7MB in the beginning and 306.2MB in the end (delta: 75.5MB). Free memory was 67.7MB in the beginning and 132.4MB in the end (delta: -64.7MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * RCFGBuilder took 9342.05ms. Allocated memory was 306.2MB in the beginning and 738.2MB in the end (delta: 432.0MB). Free memory was 132.4MB in the beginning and 493.4MB in the end (delta: -361.0MB). Peak memory consumption was 411.8MB. Max. memory is 16.1GB. * CodeCheck took 21257.69ms. Allocated memory was 738.2MB in the beginning and 964.7MB in the end (delta: 226.5MB). Free memory was 493.4MB in the beginning and 263.1MB in the end (delta: 230.3MB). Peak memory consumption was 455.8MB. Max. memory is 16.1GB. * Witness Printer took 105.54ms. Allocated memory is still 964.7MB. Free memory was 263.1MB in the beginning and 250.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. RESULT: Ultimate proved your program to be incorrect! [2023-12-02 21:59:40,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_089409df-c37f-4c9a-afa5-117f0a4b1b47/bin/ukojak-verify-Qdu7aM0XO9/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