./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label49+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_139713ed-16ab-41da-b516-d6d6a4282697/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_139713ed-16ab-41da-b516-d6d6a4282697/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_139713ed-16ab-41da-b516-d6d6a4282697/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_139713ed-16ab-41da-b516-d6d6a4282697/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_139713ed-16ab-41da-b516-d6d6a4282697/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_139713ed-16ab-41da-b516-d6d6a4282697/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 eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 --- 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-15 00:55:41,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-15 00:55:41,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-15 00:55:41,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-15 00:55:41,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-15 00:55:41,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-15 00:55:41,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-15 00:55:41,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-15 00:55:41,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-15 00:55:41,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-15 00:55:41,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-15 00:55:41,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-15 00:55:41,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-15 00:55:41,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-15 00:55:41,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-15 00:55:41,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-15 00:55:41,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-15 00:55:41,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-15 00:55:41,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-15 00:55:41,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-15 00:55:41,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-15 00:55:41,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-15 00:55:41,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-15 00:55:41,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-15 00:55:41,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-15 00:55:41,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-15 00:55:41,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-15 00:55:41,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-15 00:55:41,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-15 00:55:41,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-15 00:55:41,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-15 00:55:41,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-15 00:55:41,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-15 00:55:41,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-15 00:55:41,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-15 00:55:41,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-15 00:55:41,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-15 00:55:41,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-15 00:55:41,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-15 00:55:41,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-15 00:55:41,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-15 00:55:41,082 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_139713ed-16ab-41da-b516-d6d6a4282697/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-15 00:55:41,095 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-15 00:55:41,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-15 00:55:41,096 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-15 00:55:41,096 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-15 00:55:41,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-15 00:55:41,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-15 00:55:41,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-15 00:55:41,097 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-15 00:55:41,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-15 00:55:41,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-15 00:55:41,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-15 00:55:41,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-15 00:55:41,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-15 00:55:41,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-15 00:55:41,098 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-15 00:55:41,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-15 00:55:41,098 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-15 00:55:41,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-15 00:55:41,098 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-15 00:55:41,099 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-15 00:55:41,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-15 00:55:41,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 00:55:41,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-15 00:55:41,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-15 00:55:41,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-15 00:55:41,099 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-15 00:55:41,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-15 00:55:41,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-15 00:55:41,100 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_139713ed-16ab-41da-b516-d6d6a4282697/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_139713ed-16ab-41da-b516-d6d6a4282697/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 -> eeee6bfce8612e4c7a8797e69f7e2696f4f49417b2ea41e83d66cf7e8ad61db4 [2022-12-15 00:55:41,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-15 00:55:41,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-15 00:55:41,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-15 00:55:41,276 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-15 00:55:41,277 INFO L275 PluginConnector]: CDTParser initialized [2022-12-15 00:55:41,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_139713ed-16ab-41da-b516-d6d6a4282697/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2022-12-15 00:55:43,782 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-15 00:55:44,224 INFO L351 CDTParser]: Found 1 translation units. [2022-12-15 00:55:44,224 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_139713ed-16ab-41da-b516-d6d6a4282697/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c [2022-12-15 00:55:44,261 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_139713ed-16ab-41da-b516-d6d6a4282697/bin/ukojak-rkRKPMF4O4/data/17bdb6b9a/a493462d3aad4e3aa02f3670364d4910/FLAG0229bf120 [2022-12-15 00:55:44,343 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_139713ed-16ab-41da-b516-d6d6a4282697/bin/ukojak-rkRKPMF4O4/data/17bdb6b9a/a493462d3aad4e3aa02f3670364d4910 [2022-12-15 00:55:44,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-15 00:55:44,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-15 00:55:44,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-15 00:55:44,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-15 00:55:44,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-15 00:55:44,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 12:55:44" (1/1) ... [2022-12-15 00:55:44,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1990a51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:55:44, skipping insertion in model container [2022-12-15 00:55:44,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 12:55:44" (1/1) ... [2022-12-15 00:55:44,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-15 00:55:44,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-15 00:55:45,849 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_139713ed-16ab-41da-b516-d6d6a4282697/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2022-12-15 00:55:45,869 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_139713ed-16ab-41da-b516-d6d6a4282697/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2022-12-15 00:55:45,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 00:55:45,992 INFO L203 MainTranslator]: Completed pre-run [2022-12-15 00:55:46,782 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_139713ed-16ab-41da-b516-d6d6a4282697/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[380593,380606] [2022-12-15 00:55:46,785 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_139713ed-16ab-41da-b516-d6d6a4282697/sv-benchmarks/c/combinations/Problem05_label49+token_ring.01.cil-2.c[383339,383352] [2022-12-15 00:55:46,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-15 00:55:46,831 INFO L208 MainTranslator]: Completed translation [2022-12-15 00:55:46,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:55:46 WrapperNode [2022-12-15 00:55:46,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-15 00:55:46,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-15 00:55:46,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-15 00:55:46,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-15 00:55:46,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:55:46" (1/1) ... [2022-12-15 00:55:46,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:55:46" (1/1) ... [2022-12-15 00:55:47,090 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2022-12-15 00:55:47,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-15 00:55:47,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-15 00:55:47,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-15 00:55:47,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-15 00:55:47,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:55:46" (1/1) ... [2022-12-15 00:55:47,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:55:46" (1/1) ... [2022-12-15 00:55:47,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:55:46" (1/1) ... [2022-12-15 00:55:47,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:55:46" (1/1) ... [2022-12-15 00:55:47,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:55:46" (1/1) ... [2022-12-15 00:55:47,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:55:46" (1/1) ... [2022-12-15 00:55:47,352 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:55:46" (1/1) ... [2022-12-15 00:55:47,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:55:46" (1/1) ... [2022-12-15 00:55:47,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-15 00:55:47,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-15 00:55:47,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-15 00:55:47,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-15 00:55:47,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 12:55:46" (1/1) ... [2022-12-15 00:55:47,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-15 00:55:47,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_139713ed-16ab-41da-b516-d6d6a4282697/bin/ukojak-rkRKPMF4O4/z3 [2022-12-15 00:55:47,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_139713ed-16ab-41da-b516-d6d6a4282697/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-15 00:55:47,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_139713ed-16ab-41da-b516-d6d6a4282697/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-15 00:55:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-15 00:55:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-15 00:55:47,485 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-15 00:55:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-15 00:55:47,485 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-15 00:55:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-15 00:55:47,486 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-15 00:55:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-15 00:55:47,486 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-15 00:55:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-15 00:55:47,486 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-15 00:55:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-15 00:55:47,486 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-15 00:55:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-15 00:55:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-15 00:55:47,486 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-15 00:55:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-15 00:55:47,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-15 00:55:47,569 INFO L235 CfgBuilder]: Building ICFG [2022-12-15 00:55:47,571 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-15 00:55:52,805 INFO L276 CfgBuilder]: Performing block encoding [2022-12-15 00:55:53,893 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-15 00:55:53,894 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-15 00:55:53,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:55:53 BoogieIcfgContainer [2022-12-15 00:55:53,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-15 00:55:53,898 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-15 00:55:53,898 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-15 00:55:53,905 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-15 00:55:53,906 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:55:53" (1/1) ... [2022-12-15 00:55:53,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-15 00:55:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 1716 states and 3377 transitions. [2022-12-15 00:55:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 3377 transitions. [2022-12-15 00:55:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 00:55:53,980 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:53,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:54,178 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-15 00:55:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 1720 states and 3383 transitions. [2022-12-15 00:55:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 3383 transitions. [2022-12-15 00:55:54,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 00:55:54,270 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:54,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:54,370 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-15 00:55:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 1721 states and 3383 transitions. [2022-12-15 00:55:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 3383 transitions. [2022-12-15 00:55:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-15 00:55:54,398 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:54,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:54,462 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-15 00:55:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 1729 states and 3398 transitions. [2022-12-15 00:55:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 3398 transitions. [2022-12-15 00:55:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-15 00:55:54,504 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:54,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:54,713 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-15 00:55:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 1742 states and 3426 transitions. [2022-12-15 00:55:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3426 transitions. [2022-12-15 00:55:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-15 00:55:54,975 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:54,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:55,067 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-15 00:55:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 1745 states and 3431 transitions. [2022-12-15 00:55:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3431 transitions. [2022-12-15 00:55:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-15 00:55:55,375 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:55,419 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-15 00:55:55,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 1743 states and 3426 transitions. [2022-12-15 00:55:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 3426 transitions. [2022-12-15 00:55:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-15 00:55:55,459 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:55,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:55,625 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-15 00:55:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 1755 states and 3452 transitions. [2022-12-15 00:55:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3452 transitions. [2022-12-15 00:55:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-15 00:55:56,462 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:56,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:56,499 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-15 00:55:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 1757 states and 3458 transitions. [2022-12-15 00:55:56,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3458 transitions. [2022-12-15 00:55:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-15 00:55:56,811 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:56,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:56,846 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-15 00:55:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 1754 states and 3450 transitions. [2022-12-15 00:55:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3450 transitions. [2022-12-15 00:55:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-15 00:55:56,869 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:56,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:56,895 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-15 00:55:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 1756 states and 3453 transitions. [2022-12-15 00:55:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 3453 transitions. [2022-12-15 00:55:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-15 00:55:56,981 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:56,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:57,021 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-15 00:55:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 1753 states and 3444 transitions. [2022-12-15 00:55:57,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 3444 transitions. [2022-12-15 00:55:57,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-15 00:55:57,049 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:57,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:57,076 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-15 00:55:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 1755 states and 3448 transitions. [2022-12-15 00:55:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3448 transitions. [2022-12-15 00:55:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-15 00:55:57,102 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:57,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:57,120 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-15 00:55:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1755 states and 3447 transitions. [2022-12-15 00:55:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3447 transitions. [2022-12-15 00:55:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-15 00:55:57,142 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:57,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:57,193 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-15 00:55:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 1765 states and 3465 transitions. [2022-12-15 00:55:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 3465 transitions. [2022-12-15 00:55:57,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-15 00:55:57,542 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:57,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:57,606 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-15 00:55:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 1767 states and 3468 transitions. [2022-12-15 00:55:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3468 transitions. [2022-12-15 00:55:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-15 00:55:57,740 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:57,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:57,800 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-15 00:55:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 1767 states and 3467 transitions. [2022-12-15 00:55:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3467 transitions. [2022-12-15 00:55:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-15 00:55:57,817 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:57,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:57,884 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-15 00:55:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:57,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 1769 states and 3470 transitions. [2022-12-15 00:55:57,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 3470 transitions. [2022-12-15 00:55:57,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-15 00:55:57,905 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:57,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:57,928 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-15 00:55:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 1770 states and 3471 transitions. [2022-12-15 00:55:57,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 3471 transitions. [2022-12-15 00:55:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-15 00:55:57,995 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:57,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:58,023 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-15 00:55:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 1774 states and 3479 transitions. [2022-12-15 00:55:58,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 3479 transitions. [2022-12-15 00:55:58,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-15 00:55:58,060 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:58,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:58,171 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-15 00:55:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 1781 states and 3495 transitions. [2022-12-15 00:55:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 3495 transitions. [2022-12-15 00:55:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-15 00:55:58,415 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:58,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:58,508 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-15 00:55:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 1788 states and 3516 transitions. [2022-12-15 00:55:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 3516 transitions. [2022-12-15 00:55:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-15 00:55:59,180 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:59,208 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-15 00:55:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:59,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 1790 states and 3521 transitions. [2022-12-15 00:55:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 3521 transitions. [2022-12-15 00:55:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-15 00:55:59,377 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:59,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:59,443 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-15 00:55:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3598 states to 1797 states and 3535 transitions. [2022-12-15 00:55:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 3535 transitions. [2022-12-15 00:55:59,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-15 00:55:59,911 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:59,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:55:59,951 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-15 00:55:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:55:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 1795 states and 3529 transitions. [2022-12-15 00:55:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3529 transitions. [2022-12-15 00:55:59,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-15 00:55:59,977 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:55:59,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:55:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:00,006 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-15 00:56:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 1791 states and 3518 transitions. [2022-12-15 00:56:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3518 transitions. [2022-12-15 00:56:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-15 00:56:00,028 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:00,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:00,052 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-15 00:56:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 1793 states and 3522 transitions. [2022-12-15 00:56:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3522 transitions. [2022-12-15 00:56:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-15 00:56:00,075 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:00,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-15 00:56:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 1804 states and 3545 transitions. [2022-12-15 00:56:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 3545 transitions. [2022-12-15 00:56:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-15 00:56:00,739 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:00,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:00,763 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-15 00:56:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 1805 states and 3546 transitions. [2022-12-15 00:56:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 3546 transitions. [2022-12-15 00:56:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-15 00:56:01,126 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:01,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:01,144 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-15 00:56:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 1810 states and 3557 transitions. [2022-12-15 00:56:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 3557 transitions. [2022-12-15 00:56:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-15 00:56:01,784 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:01,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:01,799 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-15 00:56:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 1813 states and 3562 transitions. [2022-12-15 00:56:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 3562 transitions. [2022-12-15 00:56:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-15 00:56:02,142 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:02,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:02,196 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-15 00:56:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 1814 states and 3563 transitions. [2022-12-15 00:56:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 3563 transitions. [2022-12-15 00:56:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-15 00:56:02,371 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:02,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:02,400 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-15 00:56:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 1820 states and 3575 transitions. [2022-12-15 00:56:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 3575 transitions. [2022-12-15 00:56:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-15 00:56:02,961 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:02,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:02,979 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-15 00:56:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 1823 states and 3581 transitions. [2022-12-15 00:56:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 3581 transitions. [2022-12-15 00:56:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-15 00:56:03,158 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:03,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:03,175 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-15 00:56:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 1828 states and 3590 transitions. [2022-12-15 00:56:03,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 3590 transitions. [2022-12-15 00:56:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-15 00:56:03,211 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:03,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:03,530 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-15 00:56:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 1828 states and 3589 transitions. [2022-12-15 00:56:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 3589 transitions. [2022-12-15 00:56:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-15 00:56:04,122 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:04,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:04,141 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-15 00:56:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 1833 states and 3597 transitions. [2022-12-15 00:56:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 3597 transitions. [2022-12-15 00:56:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-15 00:56:04,672 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:04,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:04,691 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-15 00:56:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 1838 states and 3606 transitions. [2022-12-15 00:56:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 3606 transitions. [2022-12-15 00:56:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-15 00:56:04,797 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:04,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:04,942 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-15 00:56:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 1847 states and 3625 transitions. [2022-12-15 00:56:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 3625 transitions. [2022-12-15 00:56:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-15 00:56:05,790 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:05,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:06,022 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-15 00:56:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3748 states to 1865 states and 3681 transitions. [2022-12-15 00:56:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1865 states and 3681 transitions. [2022-12-15 00:56:08,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-15 00:56:08,044 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:08,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:08,063 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-15 00:56:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 1870 states and 3690 transitions. [2022-12-15 00:56:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 3690 transitions. [2022-12-15 00:56:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-15 00:56:08,295 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:08,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:08,312 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-15 00:56:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 1875 states and 3700 transitions. [2022-12-15 00:56:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 3700 transitions. [2022-12-15 00:56:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-15 00:56:08,359 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:08,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:08,461 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-15 00:56:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3787 states to 1884 states and 3720 transitions. [2022-12-15 00:56:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 3720 transitions. [2022-12-15 00:56:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-15 00:56:09,182 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:09,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:09,206 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-15 00:56:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 1889 states and 3735 transitions. [2022-12-15 00:56:09,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 3735 transitions. [2022-12-15 00:56:09,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-15 00:56:09,427 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:09,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-15 00:56:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 1894 states and 3748 transitions. [2022-12-15 00:56:09,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3748 transitions. [2022-12-15 00:56:09,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-15 00:56:09,695 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:09,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-15 00:56:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-15 00:56:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-15 00:56:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 1899 states and 3757 transitions. [2022-12-15 00:56:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 3757 transitions. [2022-12-15 00:56:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-15 00:56:10,004 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-15 00:56:10,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-15 00:56:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:56:10,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 00:56:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:56:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:56:10,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-15 00:56:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-15 00:56:10,184 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 46 iterations. [2022-12-15 00:56:10,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 15.12 12:56:10 ImpRootNode [2022-12-15 00:56:10,282 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-15 00:56:10,283 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-15 00:56:10,283 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-15 00:56:10,283 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-15 00:56:10,283 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 12:55:53" (3/4) ... [2022-12-15 00:56:10,285 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-15 00:56:10,397 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_139713ed-16ab-41da-b516-d6d6a4282697/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-15 00:56:10,397 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-15 00:56:10,398 INFO L158 Benchmark]: Toolchain (without parser) took 26050.59ms. Allocated memory was 140.5MB in the beginning and 998.2MB in the end (delta: 857.7MB). Free memory was 73.7MB in the beginning and 636.4MB in the end (delta: -562.7MB). Peak memory consumption was 296.9MB. Max. memory is 16.1GB. [2022-12-15 00:56:10,398 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 140.5MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-15 00:56:10,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2483.27ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 73.2MB in the beginning and 103.8MB in the end (delta: -30.6MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2022-12-15 00:56:10,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 258.56ms. Allocated memory is still 205.5MB. Free memory was 103.8MB in the beginning and 57.2MB in the end (delta: 46.6MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2022-12-15 00:56:10,399 INFO L158 Benchmark]: Boogie Preprocessor took 314.84ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 57.2MB in the beginning and 65.4MB in the end (delta: -8.2MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2022-12-15 00:56:10,399 INFO L158 Benchmark]: RCFGBuilder took 6490.80ms. Allocated memory was 247.5MB in the beginning and 669.0MB in the end (delta: 421.5MB). Free memory was 65.4MB in the beginning and 398.7MB in the end (delta: -333.3MB). Peak memory consumption was 380.9MB. Max. memory is 16.1GB. [2022-12-15 00:56:10,400 INFO L158 Benchmark]: CodeCheck took 16384.16ms. Allocated memory was 669.0MB in the beginning and 998.2MB in the end (delta: 329.3MB). Free memory was 398.7MB in the beginning and 648.0MB in the end (delta: -249.3MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. [2022-12-15 00:56:10,400 INFO L158 Benchmark]: Witness Printer took 114.66ms. Allocated memory is still 998.2MB. Free memory was 648.0MB in the beginning and 636.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-15 00:56:10,402 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.3s, OverallIterations: 46, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19218 SdHoareTripleChecker+Valid, 19.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9642 mSDsluCounter, 23522 SdHoareTripleChecker+Invalid, 16.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14764 mSDsCounter, 6059 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21643 IncrementalHoareTripleChecker+Invalid, 27702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6059 mSolverCounterUnsat, 8758 mSDtfsCounter, 21643 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27447 GetRequests, 26938 SyntacticMatches, 151 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62101 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2855 NumberOfCodeBlocks, 2855 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2717 ConstructedInterpolants, 0 QuantifiedInterpolants, 4745 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 36 PerfectInterpolantSequences, 1019/1064 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.17ms. Allocated memory is still 140.5MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2483.27ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 73.2MB in the beginning and 103.8MB in the end (delta: -30.6MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 258.56ms. Allocated memory is still 205.5MB. Free memory was 103.8MB in the beginning and 57.2MB in the end (delta: 46.6MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 314.84ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 57.2MB in the beginning and 65.4MB in the end (delta: -8.2MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * RCFGBuilder took 6490.80ms. Allocated memory was 247.5MB in the beginning and 669.0MB in the end (delta: 421.5MB). Free memory was 65.4MB in the beginning and 398.7MB in the end (delta: -333.3MB). Peak memory consumption was 380.9MB. Max. memory is 16.1GB. * CodeCheck took 16384.16ms. Allocated memory was 669.0MB in the beginning and 998.2MB in the end (delta: 329.3MB). Free memory was 398.7MB in the beginning and 648.0MB in the end (delta: -249.3MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. * Witness Printer took 114.66ms. Allocated memory is still 998.2MB. Free memory was 648.0MB in the beginning and 636.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-15 00:56:10,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_139713ed-16ab-41da-b516-d6d6a4282697/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