./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label46+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_565f0d38-3bb2-4003-8d4a-62eefdb44caf/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565f0d38-3bb2-4003-8d4a-62eefdb44caf/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_565f0d38-3bb2-4003-8d4a-62eefdb44caf/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565f0d38-3bb2-4003-8d4a-62eefdb44caf/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565f0d38-3bb2-4003-8d4a-62eefdb44caf/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_565f0d38-3bb2-4003-8d4a-62eefdb44caf/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 a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-03 00:59:52,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-03 00:59:52,621 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565f0d38-3bb2-4003-8d4a-62eefdb44caf/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-03 00:59:52,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-03 00:59:52,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-03 00:59:52,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-03 00:59:52,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-03 00:59:52,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-03 00:59:52,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-03 00:59:52,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-03 00:59:52,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-03 00:59:52,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-03 00:59:52,656 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-03 00:59:52,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-03 00:59:52,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-03 00:59:52,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-03 00:59:52,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-03 00:59:52,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-03 00:59:52,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-03 00:59:52,660 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-03 00:59:52,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-03 00:59:52,665 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-03 00:59:52,666 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-03 00:59:52,666 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-03 00:59:52,667 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-03 00:59:52,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-03 00:59:52,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 00:59:52,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-03 00:59:52,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-03 00:59:52,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-03 00:59:52,669 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-03 00:59:52,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-03 00:59:52,670 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-03 00:59:52,670 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_565f0d38-3bb2-4003-8d4a-62eefdb44caf/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_565f0d38-3bb2-4003-8d4a-62eefdb44caf/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 -> a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 [2023-12-03 00:59:52,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-03 00:59:52,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-03 00:59:52,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-03 00:59:52,925 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-03 00:59:52,926 INFO L274 PluginConnector]: CDTParser initialized [2023-12-03 00:59:52,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565f0d38-3bb2-4003-8d4a-62eefdb44caf/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c [2023-12-03 00:59:55,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-03 00:59:56,354 INFO L384 CDTParser]: Found 1 translation units. [2023-12-03 00:59:56,355 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565f0d38-3bb2-4003-8d4a-62eefdb44caf/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c [2023-12-03 00:59:56,403 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565f0d38-3bb2-4003-8d4a-62eefdb44caf/bin/ukojak-verify-Qdu7aM0XO9/data/3ac34ef0a/adf92378d7b94a8dbded1aee22e986da/FLAGe9de3d0fc [2023-12-03 00:59:56,417 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565f0d38-3bb2-4003-8d4a-62eefdb44caf/bin/ukojak-verify-Qdu7aM0XO9/data/3ac34ef0a/adf92378d7b94a8dbded1aee22e986da [2023-12-03 00:59:56,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-03 00:59:56,421 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-03 00:59:56,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-03 00:59:56,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-03 00:59:56,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-03 00:59:56,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:59:56" (1/1) ... [2023-12-03 00:59:56,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ecb2e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:59:56, skipping insertion in model container [2023-12-03 00:59:56,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:59:56" (1/1) ... [2023-12-03 00:59:56,718 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-03 00:59:58,537 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_565f0d38-3bb2-4003-8d4a-62eefdb44caf/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2023-12-03 00:59:58,556 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_565f0d38-3bb2-4003-8d4a-62eefdb44caf/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2023-12-03 00:59:58,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 00:59:58,684 INFO L202 MainTranslator]: Completed pre-run [2023-12-03 00:59:59,761 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_565f0d38-3bb2-4003-8d4a-62eefdb44caf/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2023-12-03 00:59:59,763 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_565f0d38-3bb2-4003-8d4a-62eefdb44caf/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2023-12-03 00:59:59,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 00:59:59,839 INFO L206 MainTranslator]: Completed translation [2023-12-03 00:59:59,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:59:59 WrapperNode [2023-12-03 00:59:59,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-03 00:59:59,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-03 00:59:59,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-03 00:59:59,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-03 00:59:59,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:59:59" (1/1) ... [2023-12-03 00:59:59,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:59:59" (1/1) ... [2023-12-03 01:00:00,205 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12574 [2023-12-03 01:00:00,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-03 01:00:00,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-03 01:00:00,206 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-03 01:00:00,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-03 01:00:00,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:59:59" (1/1) ... [2023-12-03 01:00:00,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:59:59" (1/1) ... [2023-12-03 01:00:00,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:59:59" (1/1) ... [2023-12-03 01:00:00,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:59:59" (1/1) ... [2023-12-03 01:00:00,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:59:59" (1/1) ... [2023-12-03 01:00:00,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:59:59" (1/1) ... [2023-12-03 01:00:00,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:59:59" (1/1) ... [2023-12-03 01:00:00,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:59:59" (1/1) ... [2023-12-03 01:00:00,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-03 01:00:00,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-03 01:00:00,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-03 01:00:00,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-03 01:00:00,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:59:59" (1/1) ... [2023-12-03 01:00:00,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 01:00:00,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565f0d38-3bb2-4003-8d4a-62eefdb44caf/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-03 01:00:00,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565f0d38-3bb2-4003-8d4a-62eefdb44caf/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-03 01:00:00,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565f0d38-3bb2-4003-8d4a-62eefdb44caf/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-03 01:00:00,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-03 01:00:00,669 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-03 01:00:00,670 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-03 01:00:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-03 01:00:00,670 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-03 01:00:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-03 01:00:00,670 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-03 01:00:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-03 01:00:00,671 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-03 01:00:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-03 01:00:00,671 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-03 01:00:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-03 01:00:00,671 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-03 01:00:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-03 01:00:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-03 01:00:00,671 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-03 01:00:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-03 01:00:00,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-03 01:00:00,782 INFO L241 CfgBuilder]: Building ICFG [2023-12-03 01:00:00,786 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-03 01:00:08,058 INFO L282 CfgBuilder]: Performing block encoding [2023-12-03 01:00:09,585 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-03 01:00:09,585 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-03 01:00:09,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:00:09 BoogieIcfgContainer [2023-12-03 01:00:09,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-03 01:00:09,589 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-03 01:00:09,589 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-03 01:00:09,599 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-03 01:00:09,599 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:00:09" (1/1) ... [2023-12-03 01:00:09,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-03 01:00:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 1718 states and 3379 transitions. [2023-12-03 01:00:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 3379 transitions. [2023-12-03 01:00:09,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-03 01:00:09,703 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:09,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:09,983 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-03 01:00:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1722 states and 3385 transitions. [2023-12-03 01:00:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3385 transitions. [2023-12-03 01:00:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-03 01:00:10,084 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:10,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:10,161 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-03 01:00:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1723 states and 3385 transitions. [2023-12-03 01:00:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 3385 transitions. [2023-12-03 01:00:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-03 01:00:10,197 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:10,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:10,244 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-03 01:00:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 1731 states and 3399 transitions. [2023-12-03 01:00:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3399 transitions. [2023-12-03 01:00:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-03 01:00:10,292 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:10,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:10,474 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-03 01:00:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 1744 states and 3426 transitions. [2023-12-03 01:00:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3426 transitions. [2023-12-03 01:00:10,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-03 01:00:10,865 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:10,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:10,955 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-03 01:00:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 1747 states and 3431 transitions. [2023-12-03 01:00:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 3431 transitions. [2023-12-03 01:00:11,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-03 01:00:11,461 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:11,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:11,513 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-03 01:00:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 1745 states and 3426 transitions. [2023-12-03 01:00:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3426 transitions. [2023-12-03 01:00:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-03 01:00:11,579 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:11,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:11,630 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-03 01:00:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 1742 states and 3418 transitions. [2023-12-03 01:00:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3418 transitions. [2023-12-03 01:00:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-03 01:00:11,663 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:11,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:11,928 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-03 01:00:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 1755 states and 3445 transitions. [2023-12-03 01:00:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3445 transitions. [2023-12-03 01:00:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-03 01:00:13,052 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:13,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:13,101 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-03 01:00:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 1757 states and 3451 transitions. [2023-12-03 01:00:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3451 transitions. [2023-12-03 01:00:13,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-03 01:00:13,410 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:13,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:13,454 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-03 01:00:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 1754 states and 3442 transitions. [2023-12-03 01:00:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3442 transitions. [2023-12-03 01:00:13,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-03 01:00:13,490 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:13,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:13,522 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-03 01:00:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 1758 states and 3448 transitions. [2023-12-03 01:00:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3448 transitions. [2023-12-03 01:00:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-03 01:00:13,627 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:13,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:13,648 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-03 01:00:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1758 states and 3447 transitions. [2023-12-03 01:00:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3447 transitions. [2023-12-03 01:00:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-03 01:00:13,673 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:13,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:13,705 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-03 01:00:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 1760 states and 3451 transitions. [2023-12-03 01:00:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 3451 transitions. [2023-12-03 01:00:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-03 01:00:13,733 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:13,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:13,808 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-03 01:00:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 1771 states and 3469 transitions. [2023-12-03 01:00:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 3469 transitions. [2023-12-03 01:00:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-03 01:00:14,287 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:14,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:14,401 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-03 01:00:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 1775 states and 3476 transitions. [2023-12-03 01:00:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3476 transitions. [2023-12-03 01:00:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-03 01:00:14,625 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:14,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:14,745 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-03 01:00:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 1777 states and 3479 transitions. [2023-12-03 01:00:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 3479 transitions. [2023-12-03 01:00:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-03 01:00:14,780 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:14,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:14,885 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-03 01:00:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 1778 states and 3480 transitions. [2023-12-03 01:00:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 3480 transitions. [2023-12-03 01:00:14,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-03 01:00:14,917 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:14,996 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-03 01:00:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 1780 states and 3482 transitions. [2023-12-03 01:00:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 3482 transitions. [2023-12-03 01:00:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-03 01:00:15,109 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:15,151 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-03 01:00:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 1784 states and 3490 transitions. [2023-12-03 01:00:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 3490 transitions. [2023-12-03 01:00:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-03 01:00:15,211 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:15,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:15,418 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-03 01:00:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 1791 states and 3506 transitions. [2023-12-03 01:00:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3506 transitions. [2023-12-03 01:00:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-03 01:00:15,820 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:15,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:15,967 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-03 01:00:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 1798 states and 3527 transitions. [2023-12-03 01:00:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3527 transitions. [2023-12-03 01:00:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-03 01:00:16,885 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:16,932 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-03 01:00:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 1800 states and 3532 transitions. [2023-12-03 01:00:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 3532 transitions. [2023-12-03 01:00:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-03 01:00:17,420 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:17,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:17,472 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-03 01:00:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 1798 states and 3526 transitions. [2023-12-03 01:00:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3526 transitions. [2023-12-03 01:00:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-03 01:00:17,511 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:17,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:17,561 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-03 01:00:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 1794 states and 3515 transitions. [2023-12-03 01:00:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3515 transitions. [2023-12-03 01:00:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-03 01:00:17,596 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:17,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:17,625 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-03 01:00:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 1795 states and 3515 transitions. [2023-12-03 01:00:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3515 transitions. [2023-12-03 01:00:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-03 01:00:17,676 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:17,776 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-03 01:00:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1804 states and 3531 transitions. [2023-12-03 01:00:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 3531 transitions. [2023-12-03 01:00:18,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-03 01:00:18,319 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:18,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:18,363 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-03 01:00:18,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 1806 states and 3535 transitions. [2023-12-03 01:00:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 3535 transitions. [2023-12-03 01:00:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-03 01:00:18,393 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:18,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:18,426 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-03 01:00:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 1811 states and 3546 transitions. [2023-12-03 01:00:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 3546 transitions. [2023-12-03 01:00:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-03 01:00:19,217 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:19,240 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-03 01:00:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 1815 states and 3552 transitions. [2023-12-03 01:00:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 3552 transitions. [2023-12-03 01:00:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 01:00:19,676 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:19,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 01:00:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-03 01:00:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-03 01:00:20,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 01:00:20,553 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 01:00:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-03 01:00:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-03 01:00:20,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 01:00:20,606 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:20,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:20,640 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 01:00:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-03 01:00:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-03 01:00:20,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 01:00:20,670 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:20,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 01:00:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-03 01:00:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-03 01:00:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 01:00:20,731 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 01:00:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-03 01:00:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-03 01:00:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 01:00:20,780 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:20,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 01:00:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-03 01:00:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-03 01:00:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 01:00:20,823 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:20,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 01:00:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-03 01:00:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-03 01:00:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 01:00:20,865 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:20,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 01:00:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-03 01:00:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-03 01:00:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 01:00:20,909 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:20,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 01:00:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-03 01:00:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-03 01:00:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 01:00:20,952 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:20,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 01:00:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2023-12-03 01:00:20,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2023-12-03 01:00:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 01:00:20,995 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:21,025 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-03 01:00:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 1829 states and 3578 transitions. [2023-12-03 01:00:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 3578 transitions. [2023-12-03 01:00:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-03 01:00:21,431 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:21,463 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-03 01:00:21,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 1834 states and 3587 transitions. [2023-12-03 01:00:21,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 3587 transitions. [2023-12-03 01:00:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-03 01:00:21,513 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:21,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:21,884 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-03 01:00:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 1834 states and 3586 transitions. [2023-12-03 01:00:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 3586 transitions. [2023-12-03 01:00:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-03 01:00:22,449 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:22,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:22,522 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-03 01:00:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 1836 states and 3588 transitions. [2023-12-03 01:00:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 3588 transitions. [2023-12-03 01:00:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-03 01:00:22,788 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:22,819 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-03 01:00:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:23,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 1843 states and 3602 transitions. [2023-12-03 01:00:23,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 3602 transitions. [2023-12-03 01:00:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-03 01:00:23,488 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:23,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:23,520 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-03 01:00:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 1847 states and 3608 transitions. [2023-12-03 01:00:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 3608 transitions. [2023-12-03 01:00:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-03 01:00:23,964 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:23,991 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-03 01:00:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 1853 states and 3618 transitions. [2023-12-03 01:00:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 3618 transitions. [2023-12-03 01:00:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-03 01:00:24,278 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:24,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:24,307 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-03 01:00:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 1859 states and 3629 transitions. [2023-12-03 01:00:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 3629 transitions. [2023-12-03 01:00:24,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-03 01:00:24,369 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:24,408 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-03 01:00:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 1861 states and 3632 transitions. [2023-12-03 01:00:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 3632 transitions. [2023-12-03 01:00:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-03 01:00:24,784 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:24,819 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-03 01:00:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 1866 states and 3641 transitions. [2023-12-03 01:00:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 3641 transitions. [2023-12-03 01:00:24,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-03 01:00:24,984 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:25,020 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-03 01:00:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:25,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 1870 states and 3647 transitions. [2023-12-03 01:00:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 3647 transitions. [2023-12-03 01:00:25,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-03 01:00:25,389 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:25,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:25,596 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-03 01:00:26,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3729 states to 1880 states and 3667 transitions. [2023-12-03 01:00:26,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 3667 transitions. [2023-12-03 01:00:26,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-03 01:00:26,574 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:26,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:26,854 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-03 01:00:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 1900 states and 3725 transitions. [2023-12-03 01:00:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 3725 transitions. [2023-12-03 01:00:29,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-03 01:00:29,025 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:29,164 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-03 01:00:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 1910 states and 3746 transitions. [2023-12-03 01:00:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 3746 transitions. [2023-12-03 01:00:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-03 01:00:30,272 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:30,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 01:00:30,311 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-03 01:00:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 01:00:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 1916 states and 3762 transitions. [2023-12-03 01:00:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 3762 transitions. [2023-12-03 01:00:30,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-03 01:00:30,661 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 01:00:30,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 01:00:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 01:00:30,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 01:00:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 01:00:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 01:00:30,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 01:00:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 01:00:30,923 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 55 iterations. [2023-12-03 01:00:30,996 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-03 01:00:31,000 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-03 01:00:31,009 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-03 01:00:31,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 03.12 01:00:31 ImpRootNode [2023-12-03 01:00:31,027 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-03 01:00:31,028 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-03 01:00:31,028 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-03 01:00:31,028 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-03 01:00:31,029 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:00:09" (3/4) ... [2023-12-03 01:00:31,030 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-03 01:00:31,050 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-03 01:00:31,052 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-03 01:00:31,057 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret29 could not be translated [2023-12-03 01:00:31,141 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565f0d38-3bb2-4003-8d4a-62eefdb44caf/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-03 01:00:31,141 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-03 01:00:31,142 INFO L158 Benchmark]: Toolchain (without parser) took 34720.95ms. Allocated memory was 136.3MB in the beginning and 1.1GB in the end (delta: 994.1MB). Free memory was 71.3MB in the beginning and 405.1MB in the end (delta: -333.8MB). Peak memory consumption was 662.1MB. Max. memory is 16.1GB. [2023-12-03 01:00:31,143 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 136.3MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-03 01:00:31,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3417.66ms. Allocated memory was 136.3MB in the beginning and 239.1MB in the end (delta: 102.8MB). Free memory was 71.1MB in the beginning and 109.1MB in the end (delta: -38.0MB). Peak memory consumption was 106.6MB. Max. memory is 16.1GB. [2023-12-03 01:00:31,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 364.56ms. Allocated memory is still 239.1MB. Free memory was 109.1MB in the beginning and 78.1MB in the end (delta: 31.0MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2023-12-03 01:00:31,144 INFO L158 Benchmark]: Boogie Preprocessor took 393.70ms. Allocated memory is still 239.1MB. Free memory was 78.1MB in the beginning and 66.5MB in the end (delta: 11.6MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2023-12-03 01:00:31,144 INFO L158 Benchmark]: RCFGBuilder took 8987.75ms. Allocated memory was 239.1MB in the beginning and 807.4MB in the end (delta: 568.3MB). Free memory was 66.5MB in the beginning and 423.4MB in the end (delta: -356.9MB). Peak memory consumption was 469.8MB. Max. memory is 16.1GB. [2023-12-03 01:00:31,145 INFO L158 Benchmark]: CodeCheck took 21438.69ms. Allocated memory was 807.4MB in the beginning and 1.1GB in the end (delta: 323.0MB). Free memory was 423.4MB in the beginning and 417.7MB in the end (delta: 5.7MB). Peak memory consumption was 328.7MB. Max. memory is 16.1GB. [2023-12-03 01:00:31,145 INFO L158 Benchmark]: Witness Printer took 113.43ms. Allocated memory is still 1.1GB. Free memory was 417.7MB in the beginning and 405.1MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-03 01:00:31,147 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.3s, OverallIterations: 55, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21092 SdHoareTripleChecker+Valid, 31.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12601 mSDsluCounter, 30322 SdHoareTripleChecker+Invalid, 26.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19546 mSDsCounter, 7360 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25823 IncrementalHoareTripleChecker+Invalid, 33183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7360 mSolverCounterUnsat, 10776 mSDtfsCounter, 25823 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33507 GetRequests, 32982 SyntacticMatches, 173 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59106 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3601 NumberOfCodeBlocks, 3601 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 3450 ConstructedInterpolants, 0 QuantifiedInterpolants, 5843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 45 PerfectInterpolantSequences, 1322/1367 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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=-1] [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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=-1] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=-1] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, token=-1] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=-1] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, 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=-1, m_i=1, m_pc=1, 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=-1, m_i=1, m_pc=1, 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=-1, m_i=1, m_pc=1, 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=-1, m_i=1, m_pc=1, 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=-1, m_i=1, m_pc=1, 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] 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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [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=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 136.3MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3417.66ms. Allocated memory was 136.3MB in the beginning and 239.1MB in the end (delta: 102.8MB). Free memory was 71.1MB in the beginning and 109.1MB in the end (delta: -38.0MB). Peak memory consumption was 106.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 364.56ms. Allocated memory is still 239.1MB. Free memory was 109.1MB in the beginning and 78.1MB in the end (delta: 31.0MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 393.70ms. Allocated memory is still 239.1MB. Free memory was 78.1MB in the beginning and 66.5MB in the end (delta: 11.6MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. * RCFGBuilder took 8987.75ms. Allocated memory was 239.1MB in the beginning and 807.4MB in the end (delta: 568.3MB). Free memory was 66.5MB in the beginning and 423.4MB in the end (delta: -356.9MB). Peak memory consumption was 469.8MB. Max. memory is 16.1GB. * CodeCheck took 21438.69ms. Allocated memory was 807.4MB in the beginning and 1.1GB in the end (delta: 323.0MB). Free memory was 423.4MB in the beginning and 417.7MB in the end (delta: 5.7MB). Peak memory consumption was 328.7MB. Max. memory is 16.1GB. * Witness Printer took 113.43ms. Allocated memory is still 1.1GB. Free memory was 417.7MB in the beginning and 405.1MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. 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-03 01:00:31,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_565f0d38-3bb2-4003-8d4a-62eefdb44caf/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