./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:20:40,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:20:40,849 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 20:20:40,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:20:40,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:20:40,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:20:40,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 20:20:40,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 20:20:40,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:20:40,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:20:40,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:20:40,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 20:20:40,899 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:20:40,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:20:40,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:20:40,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:20:40,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 20:20:40,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:20:40,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 20:20:40,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:20:40,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:20:40,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 20:20:40,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:20:40,901 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:20:40,901 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:20:40,901 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:20:40,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:20:40,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:20:40,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:20:40,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:20:40,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 20:20:40,902 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:20:40,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:20:40,902 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_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9e3e69a5dbf08552344fb04914d5344cad021a75381897bc63f6a66dc97b333 [2024-11-13 20:20:41,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:20:41,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:20:41,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:20:41,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:20:41,258 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:20:41,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c Unable to find full path for "g++" [2024-11-13 20:20:43,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:20:43,868 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:20:43,872 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c [2024-11-13 20:20:43,921 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/data/e9e18442e/52646405e820488b8a67ec873314d1ba/FLAGb07bc2dd5 [2024-11-13 20:20:44,241 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/data/e9e18442e/52646405e820488b8a67ec873314d1ba [2024-11-13 20:20:44,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:20:44,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:20:44,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:20:44,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:20:44,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:20:44,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:20:44" (1/1) ... [2024-11-13 20:20:44,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f99c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:20:44, skipping insertion in model container [2024-11-13 20:20:44,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:20:44" (1/1) ... [2024-11-13 20:20:44,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:20:46,322 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_909ec112-2ee8-4216-a57b-73548fc84898/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2024-11-13 20:20:46,363 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_909ec112-2ee8-4216-a57b-73548fc84898/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2024-11-13 20:20:46,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:20:46,561 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:20:47,703 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_909ec112-2ee8-4216-a57b-73548fc84898/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[382357,382370] [2024-11-13 20:20:47,708 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_909ec112-2ee8-4216-a57b-73548fc84898/sv-benchmarks/c/combinations/Problem05_label46+token_ring.01.cil-2.c[383339,383352] [2024-11-13 20:20:47,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:20:47,799 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:20:47,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:20:47 WrapperNode [2024-11-13 20:20:47,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:20:47,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:20:47,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:20:47,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:20:47,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:20:47" (1/1) ... [2024-11-13 20:20:47,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:20:47" (1/1) ... [2024-11-13 20:20:48,519 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12574 [2024-11-13 20:20:48,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:20:48,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:20:48,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:20:48,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:20:48,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:20:47" (1/1) ... [2024-11-13 20:20:48,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:20:47" (1/1) ... [2024-11-13 20:20:48,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:20:47" (1/1) ... [2024-11-13 20:20:48,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:20:47" (1/1) ... [2024-11-13 20:20:48,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:20:47" (1/1) ... [2024-11-13 20:20:48,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:20:47" (1/1) ... [2024-11-13 20:20:48,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:20:47" (1/1) ... [2024-11-13 20:20:48,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:20:47" (1/1) ... [2024-11-13 20:20:48,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:20:48,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:20:48,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:20:48,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:20:48,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:20:47" (1/1) ... [2024-11-13 20:20:48,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:20:49,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:20:49,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 20:20:49,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 20:20:49,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:20:49,058 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-13 20:20:49,058 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-13 20:20:49,059 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-13 20:20:49,059 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-13 20:20:49,059 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-13 20:20:49,059 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-13 20:20:49,059 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-13 20:20:49,059 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-13 20:20:49,059 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-13 20:20:49,059 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-13 20:20:49,059 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-13 20:20:49,059 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-13 20:20:49,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 20:20:49,060 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-13 20:20:49,060 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-13 20:20:49,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:20:49,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:20:49,173 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:20:49,175 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:21:00,060 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-11-13 20:21:00,060 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:21:02,454 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:21:02,455 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-13 20:21:02,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:21:02 BoogieIcfgContainer [2024-11-13 20:21:02,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:21:02,457 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:21:02,457 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:21:02,471 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:21:02,471 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:21:02" (1/1) ... [2024-11-13 20:21:02,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:21:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 1718 states and 3379 transitions. [2024-11-13 20:21:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 3379 transitions. [2024-11-13 20:21:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 20:21:02,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:02,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:02,972 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-13 20:21:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1722 states and 3385 transitions. [2024-11-13 20:21:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3385 transitions. [2024-11-13 20:21:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 20:21:03,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:03,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:03,289 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-13 20:21:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1723 states and 3385 transitions. [2024-11-13 20:21:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 3385 transitions. [2024-11-13 20:21:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 20:21:03,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:03,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:03,439 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-13 20:21:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 1731 states and 3399 transitions. [2024-11-13 20:21:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3399 transitions. [2024-11-13 20:21:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 20:21:03,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:03,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:03,793 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-13 20:21:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:04,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 1744 states and 3426 transitions. [2024-11-13 20:21:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3426 transitions. [2024-11-13 20:21:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 20:21:04,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:04,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:04,439 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-13 20:21:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 1747 states and 3431 transitions. [2024-11-13 20:21:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 3431 transitions. [2024-11-13 20:21:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 20:21:05,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:05,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:05,061 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-13 20:21:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 1745 states and 3426 transitions. [2024-11-13 20:21:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3426 transitions. [2024-11-13 20:21:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 20:21:05,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:05,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:05,226 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-13 20:21:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 1742 states and 3418 transitions. [2024-11-13 20:21:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3418 transitions. [2024-11-13 20:21:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 20:21:05,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:05,643 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-13 20:21:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 1755 states and 3445 transitions. [2024-11-13 20:21:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3445 transitions. [2024-11-13 20:21:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 20:21:07,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:21:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 1757 states and 3451 transitions. [2024-11-13 20:21:07,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3451 transitions. [2024-11-13 20:21:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 20:21:07,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:07,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:21:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 1754 states and 3442 transitions. [2024-11-13 20:21:07,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3442 transitions. [2024-11-13 20:21:07,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 20:21:07,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:07,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:21:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 1758 states and 3448 transitions. [2024-11-13 20:21:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3448 transitions. [2024-11-13 20:21:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 20:21:07,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:07,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 20:21:07,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1758 states and 3447 transitions. [2024-11-13 20:21:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3447 transitions. [2024-11-13 20:21:07,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 20:21:07,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:07,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 20:21:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 1760 states and 3451 transitions. [2024-11-13 20:21:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 3451 transitions. [2024-11-13 20:21:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 20:21:07,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:07,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:07,962 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-13 20:21:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 1771 states and 3469 transitions. [2024-11-13 20:21:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 3469 transitions. [2024-11-13 20:21:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 20:21:08,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:21:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 1775 states and 3476 transitions. [2024-11-13 20:21:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3476 transitions. [2024-11-13 20:21:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 20:21:08,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:08,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:21:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 1776 states and 3477 transitions. [2024-11-13 20:21:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 3477 transitions. [2024-11-13 20:21:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 20:21:09,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:09,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:21:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 1778 states and 3480 transitions. [2024-11-13 20:21:09,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 3480 transitions. [2024-11-13 20:21:09,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 20:21:09,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:09,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 20:21:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 1780 states and 3482 transitions. [2024-11-13 20:21:09,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 3482 transitions. [2024-11-13 20:21:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 20:21:09,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:09,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 20:21:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 1784 states and 3490 transitions. [2024-11-13 20:21:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 3490 transitions. [2024-11-13 20:21:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 20:21:09,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:09,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:21:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 1791 states and 3506 transitions. [2024-11-13 20:21:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3506 transitions. [2024-11-13 20:21:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 20:21:10,354 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:10,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 20:21:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 1798 states and 3527 transitions. [2024-11-13 20:21:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3527 transitions. [2024-11-13 20:21:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 20:21:11,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:11,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 20:21:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 1800 states and 3532 transitions. [2024-11-13 20:21:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 3532 transitions. [2024-11-13 20:21:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 20:21:12,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:12,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 20:21:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:12,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 1798 states and 3526 transitions. [2024-11-13 20:21:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3526 transitions. [2024-11-13 20:21:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 20:21:12,370 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:12,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 20:21:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 1794 states and 3515 transitions. [2024-11-13 20:21:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3515 transitions. [2024-11-13 20:21:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-13 20:21:12,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:12,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:21:13,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1803 states and 3531 transitions. [2024-11-13 20:21:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 3531 transitions. [2024-11-13 20:21:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 20:21:13,272 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:13,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 20:21:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1804 states and 3531 transitions. [2024-11-13 20:21:13,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 3531 transitions. [2024-11-13 20:21:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 20:21:13,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:13,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:21:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 1806 states and 3535 transitions. [2024-11-13 20:21:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 3535 transitions. [2024-11-13 20:21:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 20:21:13,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:13,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:21:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 1811 states and 3546 transitions. [2024-11-13 20:21:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 3546 transitions. [2024-11-13 20:21:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 20:21:14,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:14,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 20:21:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 1815 states and 3552 transitions. [2024-11-13 20:21:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 3552 transitions. [2024-11-13 20:21:15,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:21:15,022 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 20:21:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2024-11-13 20:21:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2024-11-13 20:21:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:21:16,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 20:21:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 1829 states and 3578 transitions. [2024-11-13 20:21:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 3578 transitions. [2024-11-13 20:21:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 20:21:17,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:17,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 20:21:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 1834 states and 3587 transitions. [2024-11-13 20:21:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 3587 transitions. [2024-11-13 20:21:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 20:21:17,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:17,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 20:21:18,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 1834 states and 3586 transitions. [2024-11-13 20:21:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 3586 transitions. [2024-11-13 20:21:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 20:21:18,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:18,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:21:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 1841 states and 3600 transitions. [2024-11-13 20:21:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 3600 transitions. [2024-11-13 20:21:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 20:21:19,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:19,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:21:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 1845 states and 3606 transitions. [2024-11-13 20:21:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 3606 transitions. [2024-11-13 20:21:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 20:21:20,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:20,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 20:21:20,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 1847 states and 3608 transitions. [2024-11-13 20:21:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 3608 transitions. [2024-11-13 20:21:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 20:21:20,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:20,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 20:21:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 1853 states and 3618 transitions. [2024-11-13 20:21:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 3618 transitions. [2024-11-13 20:21:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 20:21:20,979 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:20,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 20:21:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 1859 states and 3629 transitions. [2024-11-13 20:21:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 3629 transitions. [2024-11-13 20:21:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 20:21:21,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 20:21:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 1864 states and 3637 transitions. [2024-11-13 20:21:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 3637 transitions. [2024-11-13 20:21:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 20:21:21,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 20:21:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 1874 states and 3660 transitions. [2024-11-13 20:21:23,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 3660 transitions. [2024-11-13 20:21:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 20:21:23,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:23,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 20:21:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 1876 states and 3663 transitions. [2024-11-13 20:21:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 3663 transitions. [2024-11-13 20:21:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 20:21:23,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 20:21:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3791 states to 1896 states and 3722 transitions. [2024-11-13 20:21:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 3722 transitions. [2024-11-13 20:21:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 20:21:27,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:27,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 20:21:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 1900 states and 3728 transitions. [2024-11-13 20:21:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 3728 transitions. [2024-11-13 20:21:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 20:21:28,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:21:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 1910 states and 3749 transitions. [2024-11-13 20:21:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 3749 transitions. [2024-11-13 20:21:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 20:21:29,703 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:21:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 1916 states and 3765 transitions. [2024-11-13 20:21:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 3765 transitions. [2024-11-13 20:21:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 20:21:30,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:30,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 20:21:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3843 states to 1921 states and 3774 transitions. [2024-11-13 20:21:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 3774 transitions. [2024-11-13 20:21:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 20:21:30,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:30,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:21:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 20:21:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:21:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 1926 states and 3782 transitions. [2024-11-13 20:21:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 3782 transitions. [2024-11-13 20:21:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 20:21:31,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:21:31,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:21:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:21:31,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:21:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:21:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:21:31,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:21:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:21:31,466 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 48 iterations. [2024-11-13 20:21:31,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:21:31 ImpRootNode [2024-11-13 20:21:31,599 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:21:31,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:21:31,600 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:21:31,600 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:21:31,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:21:02" (3/4) ... [2024-11-13 20:21:31,602 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 20:21:31,709 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:21:31,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:21:31,710 INFO L158 Benchmark]: Toolchain (without parser) took 47465.02ms. Allocated memory was 117.4MB in the beginning and 587.2MB in the end (delta: 469.8MB). Free memory was 58.1MB in the beginning and 102.0MB in the end (delta: -43.9MB). Peak memory consumption was 422.1MB. Max. memory is 16.1GB. [2024-11-13 20:21:31,711 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:21:31,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3556.49ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 57.9MB in the beginning and 39.2MB in the end (delta: 18.7MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2024-11-13 20:21:31,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 717.10ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 39.2MB in the beginning and 310.6MB in the end (delta: -271.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-13 20:21:31,713 INFO L158 Benchmark]: Boogie Preprocessor took 467.20ms. Allocated memory is still 453.0MB. Free memory was 310.6MB in the beginning and 285.2MB in the end (delta: 25.4MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-11-13 20:21:31,715 INFO L158 Benchmark]: RCFGBuilder took 13466.30ms. Allocated memory was 453.0MB in the beginning and 587.2MB in the end (delta: 134.2MB). Free memory was 285.2MB in the beginning and 324.7MB in the end (delta: -39.5MB). Peak memory consumption was 365.0MB. Max. memory is 16.1GB. [2024-11-13 20:21:31,717 INFO L158 Benchmark]: CodeCheck took 29142.35ms. Allocated memory is still 587.2MB. Free memory was 324.7MB in the beginning and 114.6MB in the end (delta: 210.2MB). Peak memory consumption was 214.4MB. Max. memory is 16.1GB. [2024-11-13 20:21:31,718 INFO L158 Benchmark]: Witness Printer took 109.48ms. Allocated memory is still 587.2MB. Free memory was 114.6MB in the beginning and 102.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:21:31,719 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 8 procedures, 1718 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 29.0s, OverallIterations: 48, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18594 SdHoareTripleChecker+Valid, 37.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11084 mSDsluCounter, 26699 SdHoareTripleChecker+Invalid, 31.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17284 mSDsCounter, 6403 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22648 IncrementalHoareTripleChecker+Invalid, 29051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6403 mSolverCounterUnsat, 9415 mSDtfsCounter, 22648 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29313 GetRequests, 28765 SyntacticMatches, 178 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66115 ImplicationChecksByTransitivity, 21.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3102 NumberOfCodeBlocks, 3102 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2958 ConstructedInterpolants, 0 QuantifiedInterpolants, 5072 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 38 PerfectInterpolantSequences, 1129/1174 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, 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] [L11593] COND TRUE 1 [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, 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] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, 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] [L11208] COND TRUE 1 [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=-1] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=-1] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=-1] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=-1] [L11391] RET 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] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, 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 1.07ms. Allocated memory is still 117.4MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3556.49ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 57.9MB in the beginning and 39.2MB in the end (delta: 18.7MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 717.10ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 39.2MB in the beginning and 310.6MB in the end (delta: -271.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 467.20ms. Allocated memory is still 453.0MB. Free memory was 310.6MB in the beginning and 285.2MB in the end (delta: 25.4MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * RCFGBuilder took 13466.30ms. Allocated memory was 453.0MB in the beginning and 587.2MB in the end (delta: 134.2MB). Free memory was 285.2MB in the beginning and 324.7MB in the end (delta: -39.5MB). Peak memory consumption was 365.0MB. Max. memory is 16.1GB. * CodeCheck took 29142.35ms. Allocated memory is still 587.2MB. Free memory was 324.7MB in the beginning and 114.6MB in the end (delta: 210.2MB). Peak memory consumption was 214.4MB. Max. memory is 16.1GB. * Witness Printer took 109.48ms. Allocated memory is still 587.2MB. Free memory was 114.6MB in the beginning and 102.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 20:21:31,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_909ec112-2ee8-4216-a57b-73548fc84898/bin/ukojak-verify-EEHR8qb7sm/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