./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/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_d8767350-cea8-4448-a263-feb8f0202faf/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/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_d8767350-cea8-4448-a263-feb8f0202faf/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 cfaa727818e9d1eb335a3637dac175808db4c2bbb7c5a7c3c9835dd5611700d7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 04:00:24,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 04:00:24,444 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 04:00:24,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 04:00:24,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 04:00:24,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 04:00:24,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 04:00:24,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 04:00:24,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 04:00:24,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 04:00:24,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 04:00:24,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 04:00:24,488 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 04:00:24,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 04:00:24,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 04:00:24,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 04:00:24,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 04:00:24,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 04:00:24,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 04:00:24,488 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 04:00:24,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 04:00:24,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 04:00:24,489 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 04:00:24,489 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 04:00:24,489 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 04:00:24,489 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 04:00:24,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 04:00:24,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:00:24,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 04:00:24,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 04:00:24,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 04:00:24,490 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 04:00:24,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 04:00:24,490 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_d8767350-cea8-4448-a263-feb8f0202faf/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 -> cfaa727818e9d1eb335a3637dac175808db4c2bbb7c5a7c3c9835dd5611700d7 [2024-11-25 04:00:24,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 04:00:24,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 04:00:24,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 04:00:24,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 04:00:24,833 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 04:00:24,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c [2024-11-25 04:00:28,174 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/bin/ukojak-verify-ENZ3QT5qd3/data/8b6091373/aab156dfd78b4a0a841da624a705af85/FLAG52ac0254c [2024-11-25 04:00:29,361 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 04:00:29,362 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c [2024-11-25 04:00:29,408 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/bin/ukojak-verify-ENZ3QT5qd3/data/8b6091373/aab156dfd78b4a0a841da624a705af85/FLAG52ac0254c [2024-11-25 04:00:29,779 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/bin/ukojak-verify-ENZ3QT5qd3/data/8b6091373/aab156dfd78b4a0a841da624a705af85 [2024-11-25 04:00:29,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 04:00:29,782 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 04:00:29,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 04:00:29,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 04:00:29,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 04:00:29,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:00:29" (1/1) ... [2024-11-25 04:00:29,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e9de2a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:00:29, skipping insertion in model container [2024-11-25 04:00:29,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:00:29" (1/1) ... [2024-11-25 04:00:30,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 04:00:31,929 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_d8767350-cea8-4448-a263-feb8f0202faf/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[378560,378573] [2024-11-25 04:00:31,974 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_d8767350-cea8-4448-a263-feb8f0202faf/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[383339,383352] [2024-11-25 04:00:32,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:00:32,141 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 04:00:33,290 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_d8767350-cea8-4448-a263-feb8f0202faf/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[378560,378573] [2024-11-25 04:00:33,297 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_d8767350-cea8-4448-a263-feb8f0202faf/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[383339,383352] [2024-11-25 04:00:33,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 04:00:33,378 INFO L204 MainTranslator]: Completed translation [2024-11-25 04:00:33,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:00:33 WrapperNode [2024-11-25 04:00:33,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 04:00:33,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 04:00:33,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 04:00:33,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 04:00:33,391 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:00:33" (1/1) ... [2024-11-25 04:00:33,485 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:00:33" (1/1) ... [2024-11-25 04:00:33,897 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12574 [2024-11-25 04:00:33,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 04:00:33,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 04:00:33,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 04:00:33,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 04:00:33,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:00:33" (1/1) ... [2024-11-25 04:00:33,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:00:33" (1/1) ... [2024-11-25 04:00:33,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:00:33" (1/1) ... [2024-11-25 04:00:33,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:00:33" (1/1) ... [2024-11-25 04:00:34,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:00:33" (1/1) ... [2024-11-25 04:00:34,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:00:33" (1/1) ... [2024-11-25 04:00:34,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:00:33" (1/1) ... [2024-11-25 04:00:34,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:00:33" (1/1) ... [2024-11-25 04:00:34,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:00:33" (1/1) ... [2024-11-25 04:00:34,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 04:00:34,451 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 04:00:34,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 04:00:34,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 04:00:34,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:00:33" (1/1) ... [2024-11-25 04:00:34,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 04:00:34,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 04:00:34,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/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:00:34,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/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:00:34,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 04:00:34,529 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-25 04:00:34,529 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-25 04:00:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-25 04:00:34,530 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-25 04:00:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-25 04:00:34,530 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-25 04:00:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-25 04:00:34,530 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-25 04:00:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-25 04:00:34,530 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-25 04:00:34,530 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-25 04:00:34,531 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-25 04:00:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 04:00:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-25 04:00:34,531 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-25 04:00:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 04:00:34,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 04:00:34,651 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 04:00:34,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 04:00:45,541 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-11-25 04:00:45,541 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 04:00:47,353 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 04:00:47,353 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-25 04:00:47,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:00:47 BoogieIcfgContainer [2024-11-25 04:00:47,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 04:00:47,355 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 04:00:47,355 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 04:00:47,364 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 04:00:47,364 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:00:47" (1/1) ... [2024-11-25 04:00:47,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 04:00:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 1717 states and 3378 transitions. [2024-11-25 04:00:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 3378 transitions. [2024-11-25 04:00:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 04:00:47,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:47,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:47,883 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:00:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 1721 states and 3384 transitions. [2024-11-25 04:00:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 3384 transitions. [2024-11-25 04:00:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 04:00:48,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:48,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:48,160 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:00:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3391 states to 1722 states and 3384 transitions. [2024-11-25 04:00:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3384 transitions. [2024-11-25 04:00:48,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 04:00:48,199 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:48,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:48,299 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:00:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 1729 states and 3397 transitions. [2024-11-25 04:00:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 3397 transitions. [2024-11-25 04:00:48,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 04:00:48,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:48,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:48,615 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:00:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 1741 states and 3423 transitions. [2024-11-25 04:00:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 3423 transitions. [2024-11-25 04:00:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 04:00:49,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:49,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:49,356 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:00:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 1744 states and 3428 transitions. [2024-11-25 04:00:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3428 transitions. [2024-11-25 04:00:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:00:49,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:49,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:50,041 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:00:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 1742 states and 3423 transitions. [2024-11-25 04:00:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3423 transitions. [2024-11-25 04:00:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 04:00:50,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:50,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:50,187 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:00:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 1739 states and 3415 transitions. [2024-11-25 04:00:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 3415 transitions. [2024-11-25 04:00:50,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-25 04:00:50,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:50,521 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:00:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 1751 states and 3441 transitions. [2024-11-25 04:00:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 3441 transitions. [2024-11-25 04:00:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-25 04:00:52,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:52,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:52,239 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:00:52,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 1753 states and 3447 transitions. [2024-11-25 04:00:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 3447 transitions. [2024-11-25 04:00:52,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-25 04:00:52,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:52,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:52,766 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:00:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 1750 states and 3438 transitions. [2024-11-25 04:00:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3438 transitions. [2024-11-25 04:00:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-25 04:00:52,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:52,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:52,853 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:00:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 1754 states and 3444 transitions. [2024-11-25 04:00:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3444 transitions. [2024-11-25 04:00:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-25 04:00:52,969 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:52,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:52,990 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:00:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 1754 states and 3443 transitions. [2024-11-25 04:00:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3443 transitions. [2024-11-25 04:00:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-25 04:00:53,018 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:53,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:53,051 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:00:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1756 states and 3447 transitions. [2024-11-25 04:00:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 3447 transitions. [2024-11-25 04:00:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-25 04:00:53,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:53,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:53,167 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:00:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 1766 states and 3464 transitions. [2024-11-25 04:00:53,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 3464 transitions. [2024-11-25 04:00:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-25 04:00:53,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:53,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:53,768 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:00:54,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 1770 states and 3471 transitions. [2024-11-25 04:00:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 3471 transitions. [2024-11-25 04:00:54,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-25 04:00:54,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:54,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:54,120 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:00:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 1771 states and 3472 transitions. [2024-11-25 04:00:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 3472 transitions. [2024-11-25 04:00:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-25 04:00:54,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:54,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:54,247 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:00:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 1773 states and 3475 transitions. [2024-11-25 04:00:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 3475 transitions. [2024-11-25 04:00:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-25 04:00:54,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:54,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:54,333 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:00:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 1775 states and 3477 transitions. [2024-11-25 04:00:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3477 transitions. [2024-11-25 04:00:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-25 04:00:54,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:54,492 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:00:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 1779 states and 3485 transitions. [2024-11-25 04:00:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 3485 transitions. [2024-11-25 04:00:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-25 04:00:54,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:54,698 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:00:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 1786 states and 3501 transitions. [2024-11-25 04:00:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 3501 transitions. [2024-11-25 04:00:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-25 04:00:55,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:55,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:55,299 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:00:56,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 1793 states and 3522 transitions. [2024-11-25 04:00:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3522 transitions. [2024-11-25 04:00:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-25 04:00:56,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:56,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:56,437 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:00:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 1795 states and 3527 transitions. [2024-11-25 04:00:57,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3527 transitions. [2024-11-25 04:00:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-25 04:00:57,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:57,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:57,196 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:00:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 1793 states and 3521 transitions. [2024-11-25 04:00:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3521 transitions. [2024-11-25 04:00:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-25 04:00:57,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:57,320 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:00:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 1789 states and 3510 transitions. [2024-11-25 04:00:57,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 3510 transitions. [2024-11-25 04:00:57,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-25 04:00:57,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:57,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:57,416 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:00:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 1790 states and 3510 transitions. [2024-11-25 04:00:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 3510 transitions. [2024-11-25 04:00:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-25 04:00:57,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:57,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:57,608 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:00:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 1798 states and 3525 transitions. [2024-11-25 04:00:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3525 transitions. [2024-11-25 04:00:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-25 04:00:58,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:58,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:58,542 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:00:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 1800 states and 3529 transitions. [2024-11-25 04:00:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 3529 transitions. [2024-11-25 04:00:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-25 04:00:58,580 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:58,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:58,620 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:00:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:00:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 1805 states and 3540 transitions. [2024-11-25 04:00:59,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 3540 transitions. [2024-11-25 04:00:59,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-25 04:00:59,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:00:59,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:00:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:00:59,611 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:01:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 1809 states and 3546 transitions. [2024-11-25 04:01:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 3546 transitions. [2024-11-25 04:01:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-25 04:01:00,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:00,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:00,181 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:01:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3605 states to 1811 states and 3548 transitions. [2024-11-25 04:01:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 3548 transitions. [2024-11-25 04:01:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 04:01:00,673 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:00,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:00,707 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:01:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 1816 states and 3557 transitions. [2024-11-25 04:01:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 3557 transitions. [2024-11-25 04:01:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 04:01:00,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:00,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:01,140 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:01:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 1816 states and 3556 transitions. [2024-11-25 04:01:01,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 3556 transitions. [2024-11-25 04:01:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-25 04:01:01,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:01,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:02,023 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:01:02,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 1818 states and 3557 transitions. [2024-11-25 04:01:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 3557 transitions. [2024-11-25 04:01:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-25 04:01:02,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:02,224 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:01:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 1834 states and 3591 transitions. [2024-11-25 04:01:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 3591 transitions. [2024-11-25 04:01:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-25 04:01:03,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:03,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:03,933 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:01:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 1838 states and 3597 transitions. [2024-11-25 04:01:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 3597 transitions. [2024-11-25 04:01:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-25 04:01:04,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:04,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:04,723 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:01:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 1843 states and 3606 transitions. [2024-11-25 04:01:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 3606 transitions. [2024-11-25 04:01:05,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-25 04:01:05,037 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:05,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:05,071 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:01:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 1848 states and 3616 transitions. [2024-11-25 04:01:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 3616 transitions. [2024-11-25 04:01:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 04:01:05,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:05,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:05,173 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:01:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 1853 states and 3625 transitions. [2024-11-25 04:01:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 3625 transitions. [2024-11-25 04:01:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 04:01:05,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:05,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:05,809 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:01:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3711 states to 1863 states and 3648 transitions. [2024-11-25 04:01:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 3648 transitions. [2024-11-25 04:01:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-25 04:01:07,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:07,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:07,639 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:01:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 1882 states and 3710 transitions. [2024-11-25 04:01:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 3710 transitions. [2024-11-25 04:01:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-25 04:01:10,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:10,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:10,736 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:01:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3791 states to 1888 states and 3722 transitions. [2024-11-25 04:01:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 3722 transitions. [2024-11-25 04:01:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-25 04:01:12,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:12,508 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:01:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 1892 states and 3728 transitions. [2024-11-25 04:01:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 3728 transitions. [2024-11-25 04:01:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 04:01:13,013 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:13,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:13,196 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:01:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 1901 states and 3749 transitions. [2024-11-25 04:01:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 3749 transitions. [2024-11-25 04:01:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 04:01:14,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:14,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:14,660 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:01:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 1906 states and 3764 transitions. [2024-11-25 04:01:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 3764 transitions. [2024-11-25 04:01:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 04:01:15,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:15,290 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:01:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 1908 states and 3766 transitions. [2024-11-25 04:01:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 3766 transitions. [2024-11-25 04:01:16,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 04:01:16,021 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:16,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:16,049 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:01:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3842 states to 1912 states and 3773 transitions. [2024-11-25 04:01:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 3773 transitions. [2024-11-25 04:01:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 04:01:16,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:16,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:16,484 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:01:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 1916 states and 3781 transitions. [2024-11-25 04:01:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 3781 transitions. [2024-11-25 04:01:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-25 04:01:16,915 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:16,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 04:01:16,953 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:01:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 04:01:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 1918 states and 3784 transitions. [2024-11-25 04:01:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 3784 transitions. [2024-11-25 04:01:17,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-25 04:01:17,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 04:01:17,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 04:01:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:01:17,780 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 04:01:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:01:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:01:17,924 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-25 04:01:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-25 04:01:18,074 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 49 iterations. [2024-11-25 04:01:18,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 04:01:18 ImpRootNode [2024-11-25 04:01:18,183 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 04:01:18,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 04:01:18,183 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 04:01:18,184 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 04:01:18,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:00:47" (3/4) ... [2024-11-25 04:01:18,190 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-25 04:01:18,473 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 102. [2024-11-25 04:01:18,605 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 04:01:18,608 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 04:01:18,609 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 04:01:18,610 INFO L158 Benchmark]: Toolchain (without parser) took 48827.26ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 59.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 509.1MB. Max. memory is 16.1GB. [2024-11-25 04:01:18,613 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:01:18,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3595.97ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 59.8MB in the beginning and 236.8MB in the end (delta: -177.0MB). Peak memory consumption was 229.0MB. Max. memory is 16.1GB. [2024-11-25 04:01:18,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 518.07ms. Allocated memory is still 352.3MB. Free memory was 236.8MB in the beginning and 213.1MB in the end (delta: 23.6MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. [2024-11-25 04:01:18,614 INFO L158 Benchmark]: Boogie Preprocessor took 549.89ms. Allocated memory was 352.3MB in the beginning and 704.6MB in the end (delta: 352.3MB). Free memory was 213.1MB in the beginning and 518.0MB in the end (delta: -304.8MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2024-11-25 04:01:18,615 INFO L158 Benchmark]: RCFGBuilder took 12903.08ms. Allocated memory was 704.6MB in the beginning and 1.4GB in the end (delta: 729.8MB). Free memory was 518.0MB in the beginning and 679.3MB in the end (delta: -161.3MB). Peak memory consumption was 754.7MB. Max. memory is 16.1GB. [2024-11-25 04:01:18,615 INFO L158 Benchmark]: CodeCheck took 30828.30ms. Allocated memory was 1.4GB in the beginning and 1.7GB in the end (delta: 293.6MB). Free memory was 679.3MB in the beginning and 1.2GB in the end (delta: -493.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 04:01:18,615 INFO L158 Benchmark]: Witness Printer took 425.45ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.5GB in the end (delta: -318.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-25 04:01:18,617 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: 30.7s, OverallIterations: 49, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18908 SdHoareTripleChecker+Valid, 38.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11200 mSDsluCounter, 28593 SdHoareTripleChecker+Invalid, 31.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18790 mSDsCounter, 6578 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22310 IncrementalHoareTripleChecker+Invalid, 28888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6578 mSolverCounterUnsat, 9803 mSDtfsCounter, 22310 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29892 GetRequests, 29346 SyntacticMatches, 158 SemanticMatches, 388 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70794 ImplicationChecksByTransitivity, 23.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 3090 NumberOfCodeBlocks, 3090 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2948 ConstructedInterpolants, 0 QuantifiedInterpolants, 5020 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 39 PerfectInterpolantSequences, 1110/1155 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=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=-1] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=-1] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=-1] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=-1] [L11391] RET 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=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=-1] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [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=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11222] COND FALSE !(token != local + 1) [L11227] COND TRUE tmp_var <= 5 [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3595.97ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 59.8MB in the beginning and 236.8MB in the end (delta: -177.0MB). Peak memory consumption was 229.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 518.07ms. Allocated memory is still 352.3MB. Free memory was 236.8MB in the beginning and 213.1MB in the end (delta: 23.6MB). Peak memory consumption was 106.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 549.89ms. Allocated memory was 352.3MB in the beginning and 704.6MB in the end (delta: 352.3MB). Free memory was 213.1MB in the beginning and 518.0MB in the end (delta: -304.8MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * RCFGBuilder took 12903.08ms. Allocated memory was 704.6MB in the beginning and 1.4GB in the end (delta: 729.8MB). Free memory was 518.0MB in the beginning and 679.3MB in the end (delta: -161.3MB). Peak memory consumption was 754.7MB. Max. memory is 16.1GB. * CodeCheck took 30828.30ms. Allocated memory was 1.4GB in the beginning and 1.7GB in the end (delta: 293.6MB). Free memory was 679.3MB in the beginning and 1.2GB in the end (delta: -493.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 425.45ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.5GB in the end (delta: -318.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-25 04:01:18,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8767350-cea8-4448-a263-feb8f0202faf/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