./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 20:47:30,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 20:47:30,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 20:47:30,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 20:47:30,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 20:47:30,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 20:47:30,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 20:47:30,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 20:47:30,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 20:47:30,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 20:47:30,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 20:47:30,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 20:47:30,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 20:47:30,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 20:47:30,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 20:47:30,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 20:47:30,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 20:47:30,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 20:47:30,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 20:47:30,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 20:47:30,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 20:47:30,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 20:47:30,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 20:47:30,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 20:47:30,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 20:47:30,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 20:47:30,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 20:47:30,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 20:47:30,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 20:47:30,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 20:47:30,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 20:47:30,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 20:47:30,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 20:47:30,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 20:47:30,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 20:47:30,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 20:47:30,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 20:47:30,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 20:47:30,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 20:47:30,058 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 20:47:30,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 20:47:30,059 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 20:47:30,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 20:47:30,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 20:47:30,073 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 20:47:30,073 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 20:47:30,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 20:47:30,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 20:47:30,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 20:47:30,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 20:47:30,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 20:47:30,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 20:47:30,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 20:47:30,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 20:47:30,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 20:47:30,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 20:47:30,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 20:47:30,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 20:47:30,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 20:47:30,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 20:47:30,075 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 20:47:30,075 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 20:47:30,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 20:47:30,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 20:47:30,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 20:47:30,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 20:47:30,076 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 20:47:30,076 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 20:47:30,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 20:47:30,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 20:47:30,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7adc5be84218941c02109a6f05aa2044beb278121fd387aba807705fdb759027 [2022-12-14 20:47:30,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 20:47:30,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 20:47:30,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 20:47:30,296 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 20:47:30,296 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 20:47:30,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c [2022-12-14 20:47:32,871 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 20:47:33,271 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 20:47:33,271 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c [2022-12-14 20:47:33,305 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/data/fcda310db/945e6256aec74feba3c324a877f07ddf/FLAG09060cb5f [2022-12-14 20:47:33,318 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/data/fcda310db/945e6256aec74feba3c324a877f07ddf [2022-12-14 20:47:33,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 20:47:33,322 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 20:47:33,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 20:47:33,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 20:47:33,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 20:47:33,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:47:33" (1/1) ... [2022-12-14 20:47:33,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc76fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:47:33, skipping insertion in model container [2022-12-14 20:47:33,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:47:33" (1/1) ... [2022-12-14 20:47:33,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 20:47:33,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 20:47:34,835 WARN L237 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_a96df860-e000-4752-9fc7-38625ff75c20/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2022-12-14 20:47:34,854 WARN L237 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_a96df860-e000-4752-9fc7-38625ff75c20/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2022-12-14 20:47:34,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 20:47:34,962 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 20:47:35,763 WARN L237 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_a96df860-e000-4752-9fc7-38625ff75c20/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[380323,380336] [2022-12-14 20:47:35,767 WARN L237 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_a96df860-e000-4752-9fc7-38625ff75c20/sv-benchmarks/c/combinations/Problem05_label45+token_ring.01.cil-2.c[383339,383352] [2022-12-14 20:47:35,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 20:47:35,811 INFO L208 MainTranslator]: Completed translation [2022-12-14 20:47:35,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:47:35 WrapperNode [2022-12-14 20:47:35,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 20:47:35,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 20:47:35,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 20:47:35,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 20:47:35,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:47:35" (1/1) ... [2022-12-14 20:47:35,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:47:35" (1/1) ... [2022-12-14 20:47:36,112 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2022-12-14 20:47:36,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 20:47:36,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 20:47:36,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 20:47:36,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 20:47:36,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:47:35" (1/1) ... [2022-12-14 20:47:36,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:47:35" (1/1) ... [2022-12-14 20:47:36,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:47:35" (1/1) ... [2022-12-14 20:47:36,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:47:35" (1/1) ... [2022-12-14 20:47:36,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:47:35" (1/1) ... [2022-12-14 20:47:36,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:47:35" (1/1) ... [2022-12-14 20:47:36,309 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:47:35" (1/1) ... [2022-12-14 20:47:36,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:47:35" (1/1) ... [2022-12-14 20:47:36,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 20:47:36,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 20:47:36,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 20:47:36,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 20:47:36,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:47:35" (1/1) ... [2022-12-14 20:47:36,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 20:47:36,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 20:47:36,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 20:47:36,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 20:47:36,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 20:47:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-14 20:47:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-14 20:47:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-14 20:47:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-14 20:47:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-14 20:47:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-14 20:47:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-14 20:47:36,443 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-14 20:47:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-14 20:47:36,443 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-14 20:47:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-14 20:47:36,443 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-14 20:47:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 20:47:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-14 20:47:36,443 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-14 20:47:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 20:47:36,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 20:47:36,521 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 20:47:36,522 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 20:47:42,101 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 20:47:43,233 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 20:47:43,233 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-14 20:47:43,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:47:43 BoogieIcfgContainer [2022-12-14 20:47:43,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 20:47:43,238 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 20:47:43,238 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 20:47:43,244 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 20:47:43,245 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:47:43" (1/1) ... [2022-12-14 20:47:43,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 20:47:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 1716 states and 3377 transitions. [2022-12-14 20:47:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 3377 transitions. [2022-12-14 20:47:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 20:47:43,316 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:43,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:47:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 1720 states and 3383 transitions. [2022-12-14 20:47:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 3383 transitions. [2022-12-14 20:47:43,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 20:47:43,593 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:43,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:47:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 1721 states and 3383 transitions. [2022-12-14 20:47:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 3383 transitions. [2022-12-14 20:47:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 20:47:43,678 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:47:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 1729 states and 3398 transitions. [2022-12-14 20:47:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 3398 transitions. [2022-12-14 20:47:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 20:47:43,763 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:43,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 20:47:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 1742 states and 3426 transitions. [2022-12-14 20:47:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3426 transitions. [2022-12-14 20:47:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 20:47:44,243 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:44,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 20:47:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 1745 states and 3431 transitions. [2022-12-14 20:47:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3431 transitions. [2022-12-14 20:47:44,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 20:47:44,688 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:44,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 20:47:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 1743 states and 3426 transitions. [2022-12-14 20:47:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 3426 transitions. [2022-12-14 20:47:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 20:47:44,768 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 20:47:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 1755 states and 3452 transitions. [2022-12-14 20:47:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3452 transitions. [2022-12-14 20:47:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 20:47:45,978 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:45,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 20:47:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 1757 states and 3458 transitions. [2022-12-14 20:47:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3458 transitions. [2022-12-14 20:47:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 20:47:46,356 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:46,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 20:47:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 1754 states and 3450 transitions. [2022-12-14 20:47:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3450 transitions. [2022-12-14 20:47:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 20:47:46,402 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:46,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 20:47:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 1756 states and 3453 transitions. [2022-12-14 20:47:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 3453 transitions. [2022-12-14 20:47:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 20:47:46,502 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:46,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 20:47:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 1753 states and 3444 transitions. [2022-12-14 20:47:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 3444 transitions. [2022-12-14 20:47:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 20:47:46,556 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:46,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 20:47:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 1755 states and 3448 transitions. [2022-12-14 20:47:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3448 transitions. [2022-12-14 20:47:46,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 20:47:46,599 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 20:47:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1755 states and 3447 transitions. [2022-12-14 20:47:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3447 transitions. [2022-12-14 20:47:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 20:47:46,636 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:46,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 20:47:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 1765 states and 3465 transitions. [2022-12-14 20:47:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 3465 transitions. [2022-12-14 20:47:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 20:47:47,040 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:47,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:47:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 1767 states and 3468 transitions. [2022-12-14 20:47:47,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3468 transitions. [2022-12-14 20:47:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 20:47:47,299 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:47,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 20:47:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:47,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 1767 states and 3467 transitions. [2022-12-14 20:47:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3467 transitions. [2022-12-14 20:47:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 20:47:47,380 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:47,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 20:47:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 1769 states and 3470 transitions. [2022-12-14 20:47:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 3470 transitions. [2022-12-14 20:47:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 20:47:47,461 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:47,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-14 20:47:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 1770 states and 3471 transitions. [2022-12-14 20:47:47,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 3471 transitions. [2022-12-14 20:47:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 20:47:47,551 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:47,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 20:47:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 1774 states and 3479 transitions. [2022-12-14 20:47:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 3479 transitions. [2022-12-14 20:47:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 20:47:47,608 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:47,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 20:47:47,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 1781 states and 3495 transitions. [2022-12-14 20:47:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 3495 transitions. [2022-12-14 20:47:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 20:47:47,957 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:47,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 20:47:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 1788 states and 3516 transitions. [2022-12-14 20:47:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 3516 transitions. [2022-12-14 20:47:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 20:47:48,984 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:48,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 20:47:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 1790 states and 3521 transitions. [2022-12-14 20:47:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 3521 transitions. [2022-12-14 20:47:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 20:47:49,198 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 20:47:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3598 states to 1797 states and 3535 transitions. [2022-12-14 20:47:49,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 3535 transitions. [2022-12-14 20:47:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 20:47:49,759 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:49,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 20:47:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1795 states and 3529 transitions. [2022-12-14 20:47:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3529 transitions. [2022-12-14 20:47:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 20:47:49,828 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:49,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 20:47:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 1791 states and 3518 transitions. [2022-12-14 20:47:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3518 transitions. [2022-12-14 20:47:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-14 20:47:49,894 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:49,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 20:47:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 1793 states and 3522 transitions. [2022-12-14 20:47:49,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3522 transitions. [2022-12-14 20:47:49,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 20:47:49,948 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:49,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 20:47:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 1794 states and 3523 transitions. [2022-12-14 20:47:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3523 transitions. [2022-12-14 20:47:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-14 20:47:50,266 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:50,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 20:47:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 1799 states and 3534 transitions. [2022-12-14 20:47:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 3534 transitions. [2022-12-14 20:47:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-14 20:47:50,775 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 20:47:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 1802 states and 3539 transitions. [2022-12-14 20:47:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 3539 transitions. [2022-12-14 20:47:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 20:47:51,140 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:51,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:47:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 1803 states and 3539 transitions. [2022-12-14 20:47:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 3539 transitions. [2022-12-14 20:47:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 20:47:51,289 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:51,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 20:47:52,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 1818 states and 3571 transitions. [2022-12-14 20:47:52,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 3571 transitions. [2022-12-14 20:47:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 20:47:52,293 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:52,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 20:47:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 1821 states and 3577 transitions. [2022-12-14 20:47:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 3577 transitions. [2022-12-14 20:47:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 20:47:52,498 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:52,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 20:47:52,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 1826 states and 3586 transitions. [2022-12-14 20:47:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 3586 transitions. [2022-12-14 20:47:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 20:47:52,546 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:52,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 20:47:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 1826 states and 3585 transitions. [2022-12-14 20:47:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 3585 transitions. [2022-12-14 20:47:53,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 20:47:53,235 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:53,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 20:47:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 1831 states and 3594 transitions. [2022-12-14 20:47:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 3594 transitions. [2022-12-14 20:47:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 20:47:53,433 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:53,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:47:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:54,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 1840 states and 3618 transitions. [2022-12-14 20:47:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 3618 transitions. [2022-12-14 20:47:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 20:47:54,417 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:54,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 20:47:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 1845 states and 3627 transitions. [2022-12-14 20:47:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 3627 transitions. [2022-12-14 20:47:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 20:47:55,078 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 20:47:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 1847 states and 3630 transitions. [2022-12-14 20:47:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 3630 transitions. [2022-12-14 20:47:55,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 20:47:55,289 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:55,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:47:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3756 states to 1865 states and 3687 transitions. [2022-12-14 20:47:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 3687 transitions. [2022-12-14 20:47:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 20:47:57,506 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 20:47:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:57,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 1868 states and 3692 transitions. [2022-12-14 20:47:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 3692 transitions. [2022-12-14 20:47:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 20:47:57,932 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:57,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:47:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 1873 states and 3701 transitions. [2022-12-14 20:47:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3701 transitions. [2022-12-14 20:47:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 20:47:58,236 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:58,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 20:47:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 1878 states and 3711 transitions. [2022-12-14 20:47:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 3711 transitions. [2022-12-14 20:47:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 20:47:58,300 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:58,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 20:47:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3801 states to 1887 states and 3732 transitions. [2022-12-14 20:47:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 3732 transitions. [2022-12-14 20:47:59,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 20:47:59,194 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:59,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 20:47:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3816 states to 1892 states and 3747 transitions. [2022-12-14 20:47:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 3747 transitions. [2022-12-14 20:47:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 20:47:59,484 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:47:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-14 20:47:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:47:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 1894 states and 3749 transitions. [2022-12-14 20:47:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3749 transitions. [2022-12-14 20:47:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 20:47:59,893 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:47:59,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:47:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:47:59,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 20:47:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:47:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:47:59,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 20:48:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:48:00,075 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 46 iterations. [2022-12-14 20:48:00,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 08:48:00 ImpRootNode [2022-12-14 20:48:00,147 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 20:48:00,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 20:48:00,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 20:48:00,148 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 20:48:00,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:47:43" (3/4) ... [2022-12-14 20:48:00,149 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 20:48:00,243 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 20:48:00,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 20:48:00,243 INFO L158 Benchmark]: Toolchain (without parser) took 26921.21ms. Allocated memory was 148.9MB in the beginning and 931.1MB in the end (delta: 782.2MB). Free memory was 81.0MB in the beginning and 323.7MB in the end (delta: -242.7MB). Peak memory consumption was 541.0MB. Max. memory is 16.1GB. [2022-12-14 20:48:00,243 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 148.9MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 20:48:00,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2488.86ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 81.0MB in the beginning and 91.2MB in the end (delta: -10.2MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. [2022-12-14 20:48:00,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 299.90ms. Allocated memory is still 218.1MB. Free memory was 91.2MB in the beginning and 83.5MB in the end (delta: 7.7MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2022-12-14 20:48:00,244 INFO L158 Benchmark]: Boogie Preprocessor took 257.87ms. Allocated memory was 218.1MB in the beginning and 287.3MB in the end (delta: 69.2MB). Free memory was 83.5MB in the beginning and 116.9MB in the end (delta: -33.4MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2022-12-14 20:48:00,244 INFO L158 Benchmark]: RCFGBuilder took 6865.50ms. Allocated memory was 287.3MB in the beginning and 757.1MB in the end (delta: 469.8MB). Free memory was 116.9MB in the beginning and 256.5MB in the end (delta: -139.6MB). Peak memory consumption was 453.5MB. Max. memory is 16.1GB. [2022-12-14 20:48:00,245 INFO L158 Benchmark]: CodeCheck took 16909.94ms. Allocated memory was 757.1MB in the beginning and 931.1MB in the end (delta: 174.1MB). Free memory was 256.5MB in the beginning and 334.2MB in the end (delta: -77.8MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. [2022-12-14 20:48:00,245 INFO L158 Benchmark]: Witness Printer took 94.99ms. Allocated memory is still 931.1MB. Free memory was 334.2MB in the beginning and 323.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 20:48:00,246 INFO L339 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, 1716 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 46, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19327 SdHoareTripleChecker+Valid, 20.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9628 mSDsluCounter, 23472 SdHoareTripleChecker+Invalid, 17.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14688 mSDsCounter, 5897 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21662 IncrementalHoareTripleChecker+Invalid, 27559 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5897 mSolverCounterUnsat, 8784 mSDtfsCounter, 21662 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27714 GetRequests, 27195 SyntacticMatches, 145 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66133 ImplicationChecksByTransitivity, 12.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2877 NumberOfCodeBlocks, 2877 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2739 ConstructedInterpolants, 0 QuantifiedInterpolants, 4787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 36 PerfectInterpolantSequences, 1033/1078 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 [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, 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 [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, 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 [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, 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 [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, 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 [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, 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 [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, 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 [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, 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 [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, 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 [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=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 [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, 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 [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, 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 [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, 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 [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 [L11506] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11506] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-1, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, exists_runnable_thread()=1, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-1, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-1, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) [L11227] COND TRUE tmp_var <= 5 [L11228] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11236] CALL error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_M=2, f=6, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 148.9MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2488.86ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 81.0MB in the beginning and 91.2MB in the end (delta: -10.2MB). Peak memory consumption was 89.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 299.90ms. Allocated memory is still 218.1MB. Free memory was 91.2MB in the beginning and 83.5MB in the end (delta: 7.7MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 257.87ms. Allocated memory was 218.1MB in the beginning and 287.3MB in the end (delta: 69.2MB). Free memory was 83.5MB in the beginning and 116.9MB in the end (delta: -33.4MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * RCFGBuilder took 6865.50ms. Allocated memory was 287.3MB in the beginning and 757.1MB in the end (delta: 469.8MB). Free memory was 116.9MB in the beginning and 256.5MB in the end (delta: -139.6MB). Peak memory consumption was 453.5MB. Max. memory is 16.1GB. * CodeCheck took 16909.94ms. Allocated memory was 757.1MB in the beginning and 931.1MB in the end (delta: 174.1MB). Free memory was 256.5MB in the beginning and 334.2MB in the end (delta: -77.8MB). Peak memory consumption was 96.3MB. Max. memory is 16.1GB. * Witness Printer took 94.99ms. Allocated memory is still 931.1MB. Free memory was 334.2MB in the beginning and 323.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 20:48:00,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a96df860-e000-4752-9fc7-38625ff75c20/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE