./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_096a234f-7fe3-49d7-bd46-e5816e084d87/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_096a234f-7fe3-49d7-bd46-e5816e084d87/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_096a234f-7fe3-49d7-bd46-e5816e084d87/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_096a234f-7fe3-49d7-bd46-e5816e084d87/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_096a234f-7fe3-49d7-bd46-e5816e084d87/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_096a234f-7fe3-49d7-bd46-e5816e084d87/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 cfaa727818e9d1eb335a3637dac175808db4c2bbb7c5a7c3c9835dd5611700d7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 21:45:29,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 21:45:29,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 21:45:29,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 21:45:29,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 21:45:29,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 21:45:29,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 21:45:29,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 21:45:29,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 21:45:29,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 21:45:29,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 21:45:29,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 21:45:29,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 21:45:29,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 21:45:29,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 21:45:29,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 21:45:29,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 21:45:29,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 21:45:29,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 21:45:29,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 21:45:29,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 21:45:29,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 21:45:29,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 21:45:29,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 21:45:29,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 21:45:29,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 21:45:29,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 21:45:29,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 21:45:29,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 21:45:29,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 21:45:29,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 21:45:29,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 21:45:29,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 21:45:29,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 21:45:29,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 21:45:29,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 21:45:29,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 21:45:29,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 21:45:29,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 21:45:29,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 21:45:29,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 21:45:29,218 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_096a234f-7fe3-49d7-bd46-e5816e084d87/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 21:45:29,232 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 21:45:29,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 21:45:29,233 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 21:45:29,233 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 21:45:29,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 21:45:29,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 21:45:29,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 21:45:29,234 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 21:45:29,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 21:45:29,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 21:45:29,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 21:45:29,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 21:45:29,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 21:45:29,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 21:45:29,235 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 21:45:29,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 21:45:29,235 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 21:45:29,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 21:45:29,236 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 21:45:29,236 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 21:45:29,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 21:45:29,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 21:45:29,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 21:45:29,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 21:45:29,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 21:45:29,237 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 21:45:29,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 21:45:29,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 21:45:29,237 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_096a234f-7fe3-49d7-bd46-e5816e084d87/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_096a234f-7fe3-49d7-bd46-e5816e084d87/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 -> cfaa727818e9d1eb335a3637dac175808db4c2bbb7c5a7c3c9835dd5611700d7 [2022-12-14 21:45:29,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 21:45:29,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 21:45:29,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 21:45:29,431 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 21:45:29,431 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 21:45:29,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_096a234f-7fe3-49d7-bd46-e5816e084d87/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c [2022-12-14 21:45:31,965 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 21:45:32,396 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 21:45:32,396 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_096a234f-7fe3-49d7-bd46-e5816e084d87/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c [2022-12-14 21:45:32,432 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_096a234f-7fe3-49d7-bd46-e5816e084d87/bin/ukojak-rkRKPMF4O4/data/e599ee1ac/208c1b96a7cc40208f1c8dfa09ca31f2/FLAGb6e7699df [2022-12-14 21:45:32,513 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_096a234f-7fe3-49d7-bd46-e5816e084d87/bin/ukojak-rkRKPMF4O4/data/e599ee1ac/208c1b96a7cc40208f1c8dfa09ca31f2 [2022-12-14 21:45:32,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 21:45:32,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 21:45:32,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 21:45:32,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 21:45:32,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 21:45:32,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:45:32" (1/1) ... [2022-12-14 21:45:32,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33cc3928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:32, skipping insertion in model container [2022-12-14 21:45:32,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:45:32" (1/1) ... [2022-12-14 21:45:32,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 21:45:32,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 21:45:34,017 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_096a234f-7fe3-49d7-bd46-e5816e084d87/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[378560,378573] [2022-12-14 21:45:34,041 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_096a234f-7fe3-49d7-bd46-e5816e084d87/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[383339,383352] [2022-12-14 21:45:34,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 21:45:34,149 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 21:45:34,935 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_096a234f-7fe3-49d7-bd46-e5816e084d87/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[378560,378573] [2022-12-14 21:45:34,942 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_096a234f-7fe3-49d7-bd46-e5816e084d87/sv-benchmarks/c/combinations/Problem05_label42+token_ring.01.cil-2.c[383339,383352] [2022-12-14 21:45:34,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 21:45:35,000 INFO L208 MainTranslator]: Completed translation [2022-12-14 21:45:35,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:35 WrapperNode [2022-12-14 21:45:35,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 21:45:35,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 21:45:35,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 21:45:35,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 21:45:35,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:35" (1/1) ... [2022-12-14 21:45:35,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:35" (1/1) ... [2022-12-14 21:45:35,345 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12566 [2022-12-14 21:45:35,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 21:45:35,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 21:45:35,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 21:45:35,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 21:45:35,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:35" (1/1) ... [2022-12-14 21:45:35,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:35" (1/1) ... [2022-12-14 21:45:35,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:35" (1/1) ... [2022-12-14 21:45:35,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:35" (1/1) ... [2022-12-14 21:45:35,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:35" (1/1) ... [2022-12-14 21:45:35,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:35" (1/1) ... [2022-12-14 21:45:35,607 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:35" (1/1) ... [2022-12-14 21:45:35,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:35" (1/1) ... [2022-12-14 21:45:35,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 21:45:35,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 21:45:35,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 21:45:35,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 21:45:35,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:45:35" (1/1) ... [2022-12-14 21:45:35,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 21:45:35,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_096a234f-7fe3-49d7-bd46-e5816e084d87/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 21:45:35,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_096a234f-7fe3-49d7-bd46-e5816e084d87/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 21:45:35,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_096a234f-7fe3-49d7-bd46-e5816e084d87/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 21:45:35,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 21:45:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-14 21:45:35,729 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-14 21:45:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-14 21:45:35,729 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-14 21:45:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-14 21:45:35,729 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-14 21:45:35,729 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-14 21:45:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-14 21:45:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-14 21:45:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-14 21:45:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-14 21:45:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-14 21:45:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 21:45:35,730 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-14 21:45:35,730 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-14 21:45:35,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 21:45:35,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 21:45:35,809 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 21:45:35,810 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 21:45:41,455 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 21:45:42,524 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 21:45:42,525 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-14 21:45:42,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:45:42 BoogieIcfgContainer [2022-12-14 21:45:42,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 21:45:42,529 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 21:45:42,529 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 21:45:42,536 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 21:45:42,536 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:45:42" (1/1) ... [2022-12-14 21:45:42,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 21:45:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 1716 states and 3377 transitions. [2022-12-14 21:45:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 3377 transitions. [2022-12-14 21:45:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 21:45:42,604 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:42,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:45:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 1720 states and 3383 transitions. [2022-12-14 21:45:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 3383 transitions. [2022-12-14 21:45:42,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 21:45:42,938 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:45:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 1721 states and 3383 transitions. [2022-12-14 21:45:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 3383 transitions. [2022-12-14 21:45:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 21:45:43,052 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:43,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:45:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 1729 states and 3398 transitions. [2022-12-14 21:45:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 3398 transitions. [2022-12-14 21:45:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 21:45:43,151 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:43,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 21:45:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 1742 states and 3426 transitions. [2022-12-14 21:45:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3426 transitions. [2022-12-14 21:45:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 21:45:43,615 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:43,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 21:45:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 1745 states and 3431 transitions. [2022-12-14 21:45:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3431 transitions. [2022-12-14 21:45:44,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 21:45:44,037 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:44,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 21:45:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 1743 states and 3426 transitions. [2022-12-14 21:45:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 3426 transitions. [2022-12-14 21:45:44,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 21:45:44,130 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:44,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 21:45:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 1755 states and 3452 transitions. [2022-12-14 21:45:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3452 transitions. [2022-12-14 21:45:45,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 21:45:45,232 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:45,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:45:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 1757 states and 3458 transitions. [2022-12-14 21:45:45,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3458 transitions. [2022-12-14 21:45:45,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 21:45:45,595 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 21:45:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 1754 states and 3450 transitions. [2022-12-14 21:45:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3450 transitions. [2022-12-14 21:45:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 21:45:45,656 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:45,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:45:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 1756 states and 3453 transitions. [2022-12-14 21:45:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 3453 transitions. [2022-12-14 21:45:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 21:45:45,760 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:45,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:45:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 1753 states and 3444 transitions. [2022-12-14 21:45:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 3444 transitions. [2022-12-14 21:45:45,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 21:45:45,809 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:45:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 1755 states and 3448 transitions. [2022-12-14 21:45:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3448 transitions. [2022-12-14 21:45:45,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 21:45:45,850 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:45,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 21:45:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1755 states and 3447 transitions. [2022-12-14 21:45:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3447 transitions. [2022-12-14 21:45:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 21:45:45,879 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:45,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 21:45:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 1765 states and 3465 transitions. [2022-12-14 21:45:46,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 3465 transitions. [2022-12-14 21:45:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 21:45:46,301 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:46,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 21:45:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 1767 states and 3468 transitions. [2022-12-14 21:45:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3468 transitions. [2022-12-14 21:45:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 21:45:46,530 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:46,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:45:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 1767 states and 3467 transitions. [2022-12-14 21:45:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3467 transitions. [2022-12-14 21:45:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 21:45:46,608 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:46,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 21:45:46,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 1769 states and 3470 transitions. [2022-12-14 21:45:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 3470 transitions. [2022-12-14 21:45:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 21:45:46,691 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:46,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-14 21:45:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 1770 states and 3471 transitions. [2022-12-14 21:45:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 3471 transitions. [2022-12-14 21:45:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 21:45:46,776 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:46,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:45:46,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 1774 states and 3479 transitions. [2022-12-14 21:45:46,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 3479 transitions. [2022-12-14 21:45:46,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 21:45:46,834 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:46,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 21:45:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 1781 states and 3495 transitions. [2022-12-14 21:45:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 3495 transitions. [2022-12-14 21:45:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 21:45:47,216 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:47,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:45:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 1788 states and 3516 transitions. [2022-12-14 21:45:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 3516 transitions. [2022-12-14 21:45:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 21:45:47,918 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:47,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:45:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 1790 states and 3521 transitions. [2022-12-14 21:45:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 3521 transitions. [2022-12-14 21:45:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 21:45:48,296 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:48,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 21:45:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3598 states to 1797 states and 3535 transitions. [2022-12-14 21:45:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 3535 transitions. [2022-12-14 21:45:48,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 21:45:48,828 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:48,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:45:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 1795 states and 3529 transitions. [2022-12-14 21:45:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3529 transitions. [2022-12-14 21:45:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 21:45:48,889 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:48,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 21:45:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 1791 states and 3518 transitions. [2022-12-14 21:45:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3518 transitions. [2022-12-14 21:45:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-14 21:45:48,946 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:48,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 21:45:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 1793 states and 3522 transitions. [2022-12-14 21:45:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 3522 transitions. [2022-12-14 21:45:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 21:45:48,990 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:48,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 21:45:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:49,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 1794 states and 3523 transitions. [2022-12-14 21:45:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3523 transitions. [2022-12-14 21:45:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-14 21:45:49,324 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:49,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 21:45:49,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 1799 states and 3534 transitions. [2022-12-14 21:45:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 3534 transitions. [2022-12-14 21:45:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-14 21:45:49,839 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:49,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 21:45:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 1802 states and 3539 transitions. [2022-12-14 21:45:50,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 3539 transitions. [2022-12-14 21:45:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 21:45:50,145 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:45:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 1803 states and 3539 transitions. [2022-12-14 21:45:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 3539 transitions. [2022-12-14 21:45:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 21:45:50,318 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:50,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:45:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 1818 states and 3571 transitions. [2022-12-14 21:45:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 3571 transitions. [2022-12-14 21:45:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-12-14 21:45:51,240 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:45:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 1821 states and 3577 transitions. [2022-12-14 21:45:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 3577 transitions. [2022-12-14 21:45:51,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 21:45:51,437 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 21:45:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 1826 states and 3586 transitions. [2022-12-14 21:45:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 3586 transitions. [2022-12-14 21:45:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 21:45:51,501 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:51,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 21:45:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 1826 states and 3585 transitions. [2022-12-14 21:45:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 3585 transitions. [2022-12-14 21:45:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 21:45:52,230 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:52,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 21:45:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 1831 states and 3594 transitions. [2022-12-14 21:45:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 3594 transitions. [2022-12-14 21:45:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 21:45:52,427 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:52,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 21:45:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 1833 states and 3597 transitions. [2022-12-14 21:45:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 3597 transitions. [2022-12-14 21:45:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 21:45:52,658 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:52,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 21:45:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 1842 states and 3617 transitions. [2022-12-14 21:45:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 3617 transitions. [2022-12-14 21:45:53,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 21:45:53,527 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:53,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 21:45:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 1845 states and 3622 transitions. [2022-12-14 21:45:53,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 3622 transitions. [2022-12-14 21:45:53,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-12-14 21:45:53,836 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:53,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 21:45:56,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 1863 states and 3677 transitions. [2022-12-14 21:45:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 3677 transitions. [2022-12-14 21:45:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 21:45:56,271 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 21:45:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:56,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 1868 states and 3686 transitions. [2022-12-14 21:45:56,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 3686 transitions. [2022-12-14 21:45:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 21:45:56,554 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:56,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 21:45:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 1873 states and 3696 transitions. [2022-12-14 21:45:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3696 transitions. [2022-12-14 21:45:56,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 21:45:56,621 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:56,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 21:45:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 1882 states and 3716 transitions. [2022-12-14 21:45:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 3716 transitions. [2022-12-14 21:45:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 21:45:57,478 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:57,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 21:45:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 1887 states and 3731 transitions. [2022-12-14 21:45:57,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 3731 transitions. [2022-12-14 21:45:57,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 21:45:57,819 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:57,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:45:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-14 21:45:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:45:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 1889 states and 3733 transitions. [2022-12-14 21:45:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 3733 transitions. [2022-12-14 21:45:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-14 21:45:58,305 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:45:58,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:45:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:45:58,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 21:45:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:45:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:45:58,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 21:45:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:45:58,492 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 45 iterations. [2022-12-14 21:45:58,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 09:45:58 ImpRootNode [2022-12-14 21:45:58,565 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 21:45:58,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 21:45:58,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 21:45:58,566 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 21:45:58,566 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:45:42" (3/4) ... [2022-12-14 21:45:58,567 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 21:45:58,660 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_096a234f-7fe3-49d7-bd46-e5816e084d87/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 21:45:58,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 21:45:58,661 INFO L158 Benchmark]: Toolchain (without parser) took 26144.55ms. Allocated memory was 138.4MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 62.1MB in the beginning and 320.7MB in the end (delta: -258.7MB). Peak memory consumption was 681.9MB. Max. memory is 16.1GB. [2022-12-14 21:45:58,661 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 21:45:58,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2483.62ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 62.1MB in the beginning and 87.5MB in the end (delta: -25.4MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. [2022-12-14 21:45:58,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 343.75ms. Allocated memory is still 201.3MB. Free memory was 87.5MB in the beginning and 61.3MB in the end (delta: 26.2MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2022-12-14 21:45:58,662 INFO L158 Benchmark]: Boogie Preprocessor took 318.60ms. Allocated memory was 201.3MB in the beginning and 331.4MB in the end (delta: 130.0MB). Free memory was 61.3MB in the beginning and 184.2MB in the end (delta: -123.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2022-12-14 21:45:58,662 INFO L158 Benchmark]: RCFGBuilder took 6863.60ms. Allocated memory was 331.4MB in the beginning and 731.9MB in the end (delta: 400.6MB). Free memory was 184.2MB in the beginning and 393.2MB in the end (delta: -209.0MB). Peak memory consumption was 449.5MB. Max. memory is 16.1GB. [2022-12-14 21:45:58,662 INFO L158 Benchmark]: CodeCheck took 16036.42ms. Allocated memory was 731.9MB in the beginning and 1.1GB in the end (delta: 346.0MB). Free memory was 393.2MB in the beginning and 331.2MB in the end (delta: 62.0MB). Peak memory consumption was 408.1MB. Max. memory is 16.1GB. [2022-12-14 21:45:58,662 INFO L158 Benchmark]: Witness Printer took 94.80ms. Allocated memory is still 1.1GB. Free memory was 331.2MB in the beginning and 320.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 21:45:58,664 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: 15.9s, OverallIterations: 45, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18461 SdHoareTripleChecker+Valid, 19.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9148 mSDsluCounter, 22455 SdHoareTripleChecker+Invalid, 17.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13945 mSDsCounter, 5642 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20510 IncrementalHoareTripleChecker+Invalid, 26152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5642 mSolverCounterUnsat, 8510 mSDtfsCounter, 20510 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26623 GetRequests, 26120 SyntacticMatches, 149 SemanticMatches, 354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58894 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2788 NumberOfCodeBlocks, 2788 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2651 ConstructedInterpolants, 0 QuantifiedInterpolants, 4679 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 35 PerfectInterpolantSequences, 981/1026 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.19ms. Allocated memory is still 96.5MB. Free memory is still 68.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2483.62ms. Allocated memory was 138.4MB in the beginning and 201.3MB in the end (delta: 62.9MB). Free memory was 62.1MB in the beginning and 87.5MB in the end (delta: -25.4MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 343.75ms. Allocated memory is still 201.3MB. Free memory was 87.5MB in the beginning and 61.3MB in the end (delta: 26.2MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 318.60ms. Allocated memory was 201.3MB in the beginning and 331.4MB in the end (delta: 130.0MB). Free memory was 61.3MB in the beginning and 184.2MB in the end (delta: -123.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * RCFGBuilder took 6863.60ms. Allocated memory was 331.4MB in the beginning and 731.9MB in the end (delta: 400.6MB). Free memory was 184.2MB in the beginning and 393.2MB in the end (delta: -209.0MB). Peak memory consumption was 449.5MB. Max. memory is 16.1GB. * CodeCheck took 16036.42ms. Allocated memory was 731.9MB in the beginning and 1.1GB in the end (delta: 346.0MB). Free memory was 393.2MB in the beginning and 331.2MB in the end (delta: 62.0MB). Peak memory consumption was 408.1MB. Max. memory is 16.1GB. * Witness Printer took 94.80ms. Allocated memory is still 1.1GB. Free memory was 331.2MB in the beginning and 320.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 21:45:58,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_096a234f-7fe3-49d7-bd46-e5816e084d87/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