./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3 --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 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 04:28:25,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 04:28:25,413 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 04:28:25,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 04:28:25,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 04:28:25,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 04:28:25,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 04:28:25,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 04:28:25,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 04:28:25,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 04:28:25,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 04:28:25,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 04:28:25,448 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 04:28:25,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 04:28:25,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 04:28:25,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 04:28:25,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 04:28:25,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 04:28:25,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 04:28:25,449 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 04:28:25,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 04:28:25,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 04:28:25,450 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 04:28:25,450 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 04:28:25,450 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 04:28:25,450 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 04:28:25,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 04:28:25,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:28:25,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 04:28:25,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 04:28:25,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 04:28:25,451 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 04:28:25,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 04:28:25,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3 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 -> 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 [2024-11-25 04:28:25,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 04:28:25,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 04:28:25,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 04:28:25,817 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 04:28:25,818 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 04:28:25,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c [2024-11-25 04:28:28,832 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/data/af9b7352d/55a0db9fe1844c93803a535070ed997a/FLAGb387179e2 [2024-11-25 04:28:29,579 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 04:28:29,581 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c [2024-11-25 04:28:29,634 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/data/af9b7352d/55a0db9fe1844c93803a535070ed997a/FLAGb387179e2 [2024-11-25 04:28:29,659 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/data/af9b7352d/55a0db9fe1844c93803a535070ed997a [2024-11-25 04:28:29,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 04:28:29,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 04:28:29,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 04:28:29,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 04:28:29,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 04:28:29,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:28:29" (1/1) ... [2024-11-25 04:28:29,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c7dbf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:29, skipping insertion in model container [2024-11-25 04:28:29,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:28:29" (1/1) ... [2024-11-25 04:28:29,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 04:28:31,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2024-11-25 04:28:31,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2024-11-25 04:28:31,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:28:31,911 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 04:28:33,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2024-11-25 04:28:33,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2024-11-25 04:28:33,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:28:33,163 INFO L204 MainTranslator]: Completed translation [2024-11-25 04:28:33,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:33 WrapperNode [2024-11-25 04:28:33,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 04:28:33,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 04:28:33,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 04:28:33,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 04:28:33,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:33" (1/1) ... [2024-11-25 04:28:33,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:33" (1/1) ... [2024-11-25 04:28:33,674 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12574 [2024-11-25 04:28:33,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 04:28:33,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 04:28:33,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 04:28:33,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 04:28:33,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:33" (1/1) ... [2024-11-25 04:28:33,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:33" (1/1) ... [2024-11-25 04:28:33,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:33" (1/1) ... [2024-11-25 04:28:33,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:33" (1/1) ... [2024-11-25 04:28:33,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:33" (1/1) ... [2024-11-25 04:28:33,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:33" (1/1) ... [2024-11-25 04:28:34,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:33" (1/1) ... [2024-11-25 04:28:34,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:33" (1/1) ... [2024-11-25 04:28:34,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:33" (1/1) ... [2024-11-25 04:28:34,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 04:28:34,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 04:28:34,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 04:28:34,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 04:28:34,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:28:33" (1/1) ... [2024-11-25 04:28:34,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:28:34,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 04:28:34,149 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 04:28:34,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 04:28:34,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 04:28:34,182 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-25 04:28:34,182 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-25 04:28:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-25 04:28:34,183 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-25 04:28:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-25 04:28:34,183 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-25 04:28:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-25 04:28:34,183 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-25 04:28:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-25 04:28:34,183 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-25 04:28:34,183 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-25 04:28:34,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-25 04:28:34,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 04:28:34,184 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-25 04:28:34,184 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-25 04:28:34,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 04:28:34,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 04:28:34,401 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 04:28:34,403 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 04:28:45,340 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-11-25 04:28:45,341 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 04:28:47,537 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 04:28:47,539 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-25 04:28:47,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:28:47 BoogieIcfgContainer [2024-11-25 04:28:47,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 04:28:47,540 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 04:28:47,540 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 04:28:47,551 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 04:28:47,551 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:28:47" (1/1) ... [2024-11-25 04:28:47,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 04:28:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 1717 states and 3378 transitions. [2024-11-25 04:28:47,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 3378 transitions. [2024-11-25 04:28:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 04:28:47,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:47,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:28:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 1721 states and 3384 transitions. [2024-11-25 04:28:48,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 3384 transitions. [2024-11-25 04:28:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 04:28:48,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:48,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:28:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 1722 states and 3384 transitions. [2024-11-25 04:28:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3384 transitions. [2024-11-25 04:28:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 04:28:48,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:48,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 04:28:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:48,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 1729 states and 3397 transitions. [2024-11-25 04:28:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 3397 transitions. [2024-11-25 04:28:48,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 04:28:48,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:48,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 04:28:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 1741 states and 3423 transitions. [2024-11-25 04:28:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 3423 transitions. [2024-11-25 04:28:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 04:28:49,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:49,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 04:28:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 1744 states and 3428 transitions. [2024-11-25 04:28:50,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3428 transitions. [2024-11-25 04:28:50,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:28:50,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:50,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 04:28:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 1742 states and 3423 transitions. [2024-11-25 04:28:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3423 transitions. [2024-11-25 04:28:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:28:50,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:50,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 04:28:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 1739 states and 3415 transitions. [2024-11-25 04:28:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 3415 transitions. [2024-11-25 04:28:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-25 04:28:50,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 04:28:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 1751 states and 3441 transitions. [2024-11-25 04:28:52,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 3441 transitions. [2024-11-25 04:28:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-25 04:28:52,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:52,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-25 04:28:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 1753 states and 3447 transitions. [2024-11-25 04:28:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 3447 transitions. [2024-11-25 04:28:52,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-25 04:28:52,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:52,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-25 04:28:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 1750 states and 3438 transitions. [2024-11-25 04:28:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3438 transitions. [2024-11-25 04:28:53,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-25 04:28:53,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:53,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-25 04:28:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 1754 states and 3444 transitions. [2024-11-25 04:28:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3444 transitions. [2024-11-25 04:28:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-25 04:28:53,209 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:53,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 04:28:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 1754 states and 3443 transitions. [2024-11-25 04:28:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3443 transitions. [2024-11-25 04:28:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-25 04:28:53,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:53,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-25 04:28:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:53,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1756 states and 3447 transitions. [2024-11-25 04:28:53,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 3447 transitions. [2024-11-25 04:28:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-25 04:28:53,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:53,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 04:28:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:53,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 1766 states and 3464 transitions. [2024-11-25 04:28:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 3464 transitions. [2024-11-25 04:28:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-25 04:28:53,979 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 04:28:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:54,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 1770 states and 3471 transitions. [2024-11-25 04:28:54,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 3471 transitions. [2024-11-25 04:28:54,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-25 04:28:54,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:54,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 04:28:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:54,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 1771 states and 3472 transitions. [2024-11-25 04:28:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 3472 transitions. [2024-11-25 04:28:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-25 04:28:54,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:54,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 04:28:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 1773 states and 3475 transitions. [2024-11-25 04:28:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 3475 transitions. [2024-11-25 04:28:54,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-25 04:28:54,687 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:54,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-25 04:28:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 1775 states and 3477 transitions. [2024-11-25 04:28:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3477 transitions. [2024-11-25 04:28:54,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-25 04:28:54,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:54,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 04:28:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 1779 states and 3485 transitions. [2024-11-25 04:28:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 3485 transitions. [2024-11-25 04:28:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-25 04:28:54,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:54,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 04:28:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 1786 states and 3501 transitions. [2024-11-25 04:28:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 3501 transitions. [2024-11-25 04:28:55,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-25 04:28:55,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:55,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 04:28:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 1793 states and 3522 transitions. [2024-11-25 04:28:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3522 transitions. [2024-11-25 04:28:56,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-25 04:28:56,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:56,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 04:28:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 1795 states and 3527 transitions. [2024-11-25 04:28:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3527 transitions. [2024-11-25 04:28:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-25 04:28:57,634 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:57,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 04:28:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 1793 states and 3521 transitions. [2024-11-25 04:28:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3521 transitions. [2024-11-25 04:28:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-25 04:28:57,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 04:28:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 1789 states and 3510 transitions. [2024-11-25 04:28:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 3510 transitions. [2024-11-25 04:28:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-25 04:28:57,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:57,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 04:28:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 1790 states and 3510 transitions. [2024-11-25 04:28:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 3510 transitions. [2024-11-25 04:28:58,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-25 04:28:58,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 04:28:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 1798 states and 3525 transitions. [2024-11-25 04:28:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3525 transitions. [2024-11-25 04:28:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-25 04:28:59,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:59,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 04:28:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:28:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 1800 states and 3529 transitions. [2024-11-25 04:28:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 3529 transitions. [2024-11-25 04:28:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-25 04:28:59,162 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:28:59,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:28:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:28:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 04:29:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 1805 states and 3540 transitions. [2024-11-25 04:29:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 3540 transitions. [2024-11-25 04:29:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-25 04:29:00,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 04:29:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 1809 states and 3546 transitions. [2024-11-25 04:29:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 3546 transitions. [2024-11-25 04:29:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-25 04:29:00,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:00,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 04:29:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3605 states to 1811 states and 3548 transitions. [2024-11-25 04:29:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 3548 transitions. [2024-11-25 04:29:01,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 04:29:01,399 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:01,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-25 04:29:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 1816 states and 3557 transitions. [2024-11-25 04:29:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 3557 transitions. [2024-11-25 04:29:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 04:29:01,492 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:01,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-25 04:29:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 1816 states and 3556 transitions. [2024-11-25 04:29:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 3556 transitions. [2024-11-25 04:29:02,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-25 04:29:02,727 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:02,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-25 04:29:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 1818 states and 3557 transitions. [2024-11-25 04:29:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 3557 transitions. [2024-11-25 04:29:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-25 04:29:02,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:02,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 04:29:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 1834 states and 3591 transitions. [2024-11-25 04:29:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 3591 transitions. [2024-11-25 04:29:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-25 04:29:04,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:04,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 04:29:05,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 1838 states and 3597 transitions. [2024-11-25 04:29:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 3597 transitions. [2024-11-25 04:29:05,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-25 04:29:05,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:05,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-25 04:29:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 1843 states and 3606 transitions. [2024-11-25 04:29:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 3606 transitions. [2024-11-25 04:29:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-25 04:29:05,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:05,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-25 04:29:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 1848 states and 3616 transitions. [2024-11-25 04:29:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 3616 transitions. [2024-11-25 04:29:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 04:29:06,009 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:06,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-25 04:29:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 1850 states and 3619 transitions. [2024-11-25 04:29:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 3619 transitions. [2024-11-25 04:29:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 04:29:06,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:06,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 04:29:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 1855 states and 3628 transitions. [2024-11-25 04:29:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 3628 transitions. [2024-11-25 04:29:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 04:29:06,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:06,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-25 04:29:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 1859 states and 3634 transitions. [2024-11-25 04:29:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 3634 transitions. [2024-11-25 04:29:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 04:29:07,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:07,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 04:29:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 1869 states and 3654 transitions. [2024-11-25 04:29:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 3654 transitions. [2024-11-25 04:29:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-25 04:29:08,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-25 04:29:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3777 states to 1888 states and 3710 transitions. [2024-11-25 04:29:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 3710 transitions. [2024-11-25 04:29:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 04:29:11,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:11,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:11,966 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 04:29:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 1897 states and 3730 transitions. [2024-11-25 04:29:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 3730 transitions. [2024-11-25 04:29:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 04:29:13,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-25 04:29:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3812 states to 1902 states and 3745 transitions. [2024-11-25 04:29:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 3745 transitions. [2024-11-25 04:29:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 04:29:14,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 04:29:14,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3816 states to 1904 states and 3749 transitions. [2024-11-25 04:29:14,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 3749 transitions. [2024-11-25 04:29:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 04:29:14,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 04:29:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3816 states to 1904 states and 3749 transitions. [2024-11-25 04:29:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 3749 transitions. [2024-11-25 04:29:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 04:29:14,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 04:29:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3816 states to 1904 states and 3749 transitions. [2024-11-25 04:29:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 3749 transitions. [2024-11-25 04:29:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 04:29:15,005 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:15,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 04:29:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3816 states to 1904 states and 3749 transitions. [2024-11-25 04:29:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 3749 transitions. [2024-11-25 04:29:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 04:29:15,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:15,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 04:29:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3816 states to 1904 states and 3749 transitions. [2024-11-25 04:29:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 3749 transitions. [2024-11-25 04:29:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 04:29:15,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:15,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 04:29:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3816 states to 1904 states and 3749 transitions. [2024-11-25 04:29:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 3749 transitions. [2024-11-25 04:29:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 04:29:15,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:15,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 04:29:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3816 states to 1904 states and 3749 transitions. [2024-11-25 04:29:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 3749 transitions. [2024-11-25 04:29:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 04:29:15,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-25 04:29:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 1908 states and 3756 transitions. [2024-11-25 04:29:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 3756 transitions. [2024-11-25 04:29:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 04:29:15,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:15,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:29:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-25 04:29:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:29:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3831 states to 1912 states and 3764 transitions. [2024-11-25 04:29:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 3764 transitions. [2024-11-25 04:29:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-25 04:29:16,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:29:16,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:29:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:29:16,388 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 04:29:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:29:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:29:16,582 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 04:29:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:29:16,764 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 54 iterations. [2024-11-25 04:29:16,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 04:29:16 ImpRootNode [2024-11-25 04:29:16,909 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 04:29:16,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 04:29:16,909 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 04:29:16,910 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 04:29:16,914 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:28:47" (3/4) ... [2024-11-25 04:29:16,915 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-25 04:29:17,079 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 102. [2024-11-25 04:29:17,223 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 04:29:17,224 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 04:29:17,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 04:29:17,225 INFO L158 Benchmark]: Toolchain (without parser) took 47561.68ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 59.8MB in the beginning and 725.4MB in the end (delta: -665.6MB). Peak memory consumption was 667.0MB. Max. memory is 16.1GB. [2024-11-25 04:29:17,225 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 167.8MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:29:17,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3501.70ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 59.4MB in the beginning and 239.9MB in the end (delta: -180.4MB). Peak memory consumption was 252.8MB. Max. memory is 16.1GB. [2024-11-25 04:29:17,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 508.04ms. Allocated memory is still 352.3MB. Free memory was 239.9MB in the beginning and 206.3MB in the end (delta: 33.6MB). Peak memory consumption was 90.9MB. Max. memory is 16.1GB. [2024-11-25 04:29:17,227 INFO L158 Benchmark]: Boogie Preprocessor took 430.14ms. Allocated memory is still 352.3MB. Free memory was 206.3MB in the beginning and 149.0MB in the end (delta: 57.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-25 04:29:17,227 INFO L158 Benchmark]: RCFGBuilder took 13432.17ms. Allocated memory was 352.3MB in the beginning and 1.2GB in the end (delta: 805.3MB). Free memory was 149.0MB in the beginning and 624.8MB in the end (delta: -475.8MB). Peak memory consumption was 587.7MB. Max. memory is 16.1GB. [2024-11-25 04:29:17,228 INFO L158 Benchmark]: CodeCheck took 29368.43ms. Allocated memory was 1.2GB in the beginning and 1.5GB in the end (delta: 293.6MB). Free memory was 624.8MB in the beginning and 746.4MB in the end (delta: -121.6MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. [2024-11-25 04:29:17,228 INFO L158 Benchmark]: Witness Printer took 314.74ms. Allocated memory is still 1.5GB. Free memory was 746.4MB in the beginning and 725.4MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 04:29:17,231 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, 1717 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 29.2s, OverallIterations: 54, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21949 SdHoareTripleChecker+Valid, 48.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13268 mSDsluCounter, 33365 SdHoareTripleChecker+Invalid, 41.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22303 mSDsCounter, 7674 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26113 IncrementalHoareTripleChecker+Invalid, 33787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7674 mSolverCounterUnsat, 11062 mSDtfsCounter, 26113 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33787 GetRequests, 33267 SyntacticMatches, 164 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60116 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3500 NumberOfCodeBlocks, 3500 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 3353 ConstructedInterpolants, 0 QuantifiedInterpolants, 5559 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 44 PerfectInterpolantSequences, 1394/1439 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, ConComCheckerStatistics: 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, 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, 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, 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, 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, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [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] [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, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\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, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL 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] [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET transmit1() [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, 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, 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 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] [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET transmit1() [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) [L11227] COND TRUE tmp_var <= 5 [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 167.8MB. Free memory is still 103.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3501.70ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 59.4MB in the beginning and 239.9MB in the end (delta: -180.4MB). Peak memory consumption was 252.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 508.04ms. Allocated memory is still 352.3MB. Free memory was 239.9MB in the beginning and 206.3MB in the end (delta: 33.6MB). Peak memory consumption was 90.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 430.14ms. Allocated memory is still 352.3MB. Free memory was 206.3MB in the beginning and 149.0MB in the end (delta: 57.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * RCFGBuilder took 13432.17ms. Allocated memory was 352.3MB in the beginning and 1.2GB in the end (delta: 805.3MB). Free memory was 149.0MB in the beginning and 624.8MB in the end (delta: -475.8MB). Peak memory consumption was 587.7MB. Max. memory is 16.1GB. * CodeCheck took 29368.43ms. Allocated memory was 1.2GB in the beginning and 1.5GB in the end (delta: 293.6MB). Free memory was 624.8MB in the beginning and 746.4MB in the end (delta: -121.6MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. * Witness Printer took 314.74ms. Allocated memory is still 1.5GB. Free memory was 746.4MB in the beginning and 725.4MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-25 04:29:17,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8fab478-266a-44d1-ad19-f281033fa3a1/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with 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