./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/bist_cell.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 --- 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-38b53e6 [2022-11-26 01:10:28,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 01:10:28,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 01:10:28,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 01:10:28,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 01:10:28,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 01:10:28,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 01:10:28,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 01:10:28,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 01:10:28,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 01:10:28,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 01:10:28,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 01:10:28,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 01:10:28,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 01:10:28,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 01:10:28,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 01:10:28,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 01:10:28,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 01:10:28,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 01:10:28,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 01:10:28,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 01:10:28,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 01:10:28,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 01:10:28,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 01:10:28,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 01:10:28,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 01:10:28,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 01:10:28,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 01:10:28,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 01:10:28,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 01:10:28,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 01:10:28,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 01:10:28,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 01:10:28,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 01:10:28,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 01:10:28,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 01:10:28,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 01:10:28,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 01:10:28,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 01:10:28,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 01:10:28,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 01:10:28,434 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 01:10:28,455 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 01:10:28,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 01:10:28,456 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 01:10:28,456 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 01:10:28,456 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 01:10:28,457 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 01:10:28,457 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 01:10:28,457 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 01:10:28,457 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 01:10:28,458 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 01:10:28,458 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 01:10:28,458 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 01:10:28,458 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 01:10:28,458 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 01:10:28,459 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 01:10:28,459 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 01:10:28,459 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 01:10:28,459 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 01:10:28,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 01:10:28,460 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 01:10:28,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 01:10:28,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 01:10:28,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 01:10:28,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 01:10:28,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 01:10:28,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 01:10:28,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 01:10:28,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 01:10:28,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 01:10:28,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 01:10:28,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 01:10:28,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 01:10:28,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:10:28,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 01:10:28,464 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 01:10:28,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 01:10:28,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 01:10:28,465 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 01:10:28,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 01:10:28,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 01:10:28,465 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 01:10:28,465 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_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/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_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur 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 -> Taipan 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 -> de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 [2022-11-26 01:10:28,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:10:28,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:10:28,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:10:28,786 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:10:28,787 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:10:28,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/systemc/bist_cell.cil.c [2022-11-26 01:10:31,924 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:10:32,154 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:10:32,154 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/sv-benchmarks/c/systemc/bist_cell.cil.c [2022-11-26 01:10:32,172 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/data/eb2e360b8/5095cd00c7fa4517a57093af59c80b6b/FLAG923e83d25 [2022-11-26 01:10:32,187 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/data/eb2e360b8/5095cd00c7fa4517a57093af59c80b6b [2022-11-26 01:10:32,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:10:32,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:10:32,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:10:32,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:10:32,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:10:32,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:10:32" (1/1) ... [2022-11-26 01:10:32,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23584056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32, skipping insertion in model container [2022-11-26 01:10:32,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:10:32" (1/1) ... [2022-11-26 01:10:32,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:10:32,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:10:32,379 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_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2022-11-26 01:10:32,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:10:32,461 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:10:32,473 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_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/sv-benchmarks/c/systemc/bist_cell.cil.c[639,652] [2022-11-26 01:10:32,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:10:32,515 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:10:32,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32 WrapperNode [2022-11-26 01:10:32,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:10:32,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:10:32,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:10:32,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:10:32,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32" (1/1) ... [2022-11-26 01:10:32,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32" (1/1) ... [2022-11-26 01:10:32,588 INFO L138 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 229 [2022-11-26 01:10:32,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:10:32,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:10:32,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:10:32,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:10:32,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32" (1/1) ... [2022-11-26 01:10:32,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32" (1/1) ... [2022-11-26 01:10:32,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32" (1/1) ... [2022-11-26 01:10:32,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32" (1/1) ... [2022-11-26 01:10:32,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32" (1/1) ... [2022-11-26 01:10:32,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32" (1/1) ... [2022-11-26 01:10:32,615 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32" (1/1) ... [2022-11-26 01:10:32,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32" (1/1) ... [2022-11-26 01:10:32,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:10:32,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:10:32,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:10:32,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:10:32,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32" (1/1) ... [2022-11-26 01:10:32,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:10:32,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:32,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:10:32,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:10:32,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 01:10:32,709 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-26 01:10:32,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-26 01:10:32,710 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-26 01:10:32,710 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-26 01:10:32,710 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-26 01:10:32,710 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-26 01:10:32,710 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-26 01:10:32,710 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-26 01:10:32,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 01:10:32,711 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-26 01:10:32,711 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-26 01:10:32,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:10:32,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:10:32,789 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:10:32,791 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:10:33,192 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:10:33,506 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:10:33,507 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-26 01:10:33,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:10:33 BoogieIcfgContainer [2022-11-26 01:10:33,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:10:33,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:10:33,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:10:33,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:10:33,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:10:32" (1/3) ... [2022-11-26 01:10:33,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc3bd36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:10:33, skipping insertion in model container [2022-11-26 01:10:33,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:32" (2/3) ... [2022-11-26 01:10:33,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc3bd36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:10:33, skipping insertion in model container [2022-11-26 01:10:33,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:10:33" (3/3) ... [2022-11-26 01:10:33,525 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2022-11-26 01:10:33,555 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:10:33,556 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 01:10:33,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:10:33,612 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@195113a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:10:33,612 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 01:10:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-26 01:10:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 01:10:33,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:33,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:33,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:33,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:33,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1643096652, now seen corresponding path program 1 times [2022-11-26 01:10:33,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:33,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852755429] [2022-11-26 01:10:33,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:33,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:33,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:33,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852755429] [2022-11-26 01:10:33,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852755429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:33,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:10:33,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:10:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373209366] [2022-11-26 01:10:33,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:33,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 01:10:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:34,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 01:10:34,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 01:10:34,040 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-26 01:10:34,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:34,135 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2022-11-26 01:10:34,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 01:10:34,138 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 18 [2022-11-26 01:10:34,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:34,145 INFO L225 Difference]: With dead ends: 68 [2022-11-26 01:10:34,146 INFO L226 Difference]: Without dead ends: 35 [2022-11-26 01:10:34,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 01:10:34,152 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:34,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:10:34,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-26 01:10:34,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-26 01:10:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-26 01:10:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-11-26 01:10:34,204 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 18 [2022-11-26 01:10:34,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:34,207 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-11-26 01:10:34,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-26 01:10:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-11-26 01:10:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-26 01:10:34,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:34,210 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:34,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 01:10:34,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:34,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1599515232, now seen corresponding path program 1 times [2022-11-26 01:10:34,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:34,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062035494] [2022-11-26 01:10:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:34,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-26 01:10:34,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:34,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062035494] [2022-11-26 01:10:34,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062035494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:10:34,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35003904] [2022-11-26 01:10:34,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:35,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:35,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:35,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:35,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 01:10:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:35,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-26 01:10:35,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:35,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 01:10:36,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35003904] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:36,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224114659] [2022-11-26 01:10:36,672 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-26 01:10:36,673 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:36,676 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:36,685 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:36,686 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:38,553 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 57 for LOIs [2022-11-26 01:10:39,018 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 107 for LOIs [2022-11-26 01:10:40,760 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 206 for LOIs [2022-11-26 01:10:44,752 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 57 for LOIs [2022-11-26 01:10:44,761 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 111 for LOIs [2022-11-26 01:10:44,902 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:56,156 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '489#(and (not (= ~comp_m1_st~0 0)) (= 0 ~z_val_t~0) (not (= ~d1_ev~0 1)) (= ~comp_m1_i~0 0) (not (= ~d0_ev~0 1)) (= |ULTIMATE.start_stop_simulation_~__retres2~0#1| |ULTIMATE.start_stop_simulation_#res#1|) (not (= ~b0_ev~0 1)) (= ~d1_val_t~0 1) (= |ULTIMATE.start_start_simulation_~tmp~3#1| |ULTIMATE.start_stop_simulation_#res#1|) (not (= ~z_ev~0 1)) (not (= ~b1_ev~0 1)) (not (= ~z_val~0 0)) (= ~b0_val_t~0 1) (= |ULTIMATE.start_eval_~tmp___0~0#1| 0) (<= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 3) (= |#NULL.offset| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (<= 0 |#StackHeapBarrier|) (<= 3 |ULTIMATE.start_start_simulation_~kernel_st~0#1|) (= |#NULL.base| 0) (= |ULTIMATE.start_stop_simulation_~__retres2~0#1| 1))' at error location [2022-11-26 01:10:56,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:10:56,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:10:56,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-11-26 01:10:56,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265178623] [2022-11-26 01:10:56,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:10:56,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-26 01:10:56,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:56,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-26 01:10:56,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2042, Unknown=0, NotChecked=0, Total=2256 [2022-11-26 01:10:56,163 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 18 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 14 states have internal predecessors, (40), 6 states have call successors, (26), 8 states have call predecessors, (26), 9 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) [2022-11-26 01:10:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:56,648 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2022-11-26 01:10:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 01:10:56,649 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 14 states have internal predecessors, (40), 6 states have call successors, (26), 8 states have call predecessors, (26), 9 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) Word has length 44 [2022-11-26 01:10:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:56,651 INFO L225 Difference]: With dead ends: 79 [2022-11-26 01:10:56,652 INFO L226 Difference]: Without dead ends: 75 [2022-11-26 01:10:56,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2022-11-26 01:10:56,654 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 111 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:56,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 90 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 01:10:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-26 01:10:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2022-11-26 01:10:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 17 states have call successors, (17), 11 states have call predecessors, (17), 11 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-26 01:10:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2022-11-26 01:10:56,670 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 44 [2022-11-26 01:10:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:56,671 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2022-11-26 01:10:56,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 14 states have internal predecessors, (40), 6 states have call successors, (26), 8 states have call predecessors, (26), 9 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) [2022-11-26 01:10:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2022-11-26 01:10:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-26 01:10:56,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:56,674 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:56,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 01:10:56,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:56,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:56,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:56,881 INFO L85 PathProgramCache]: Analyzing trace with hash 525203780, now seen corresponding path program 1 times [2022-11-26 01:10:56,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:56,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446733601] [2022-11-26 01:10:56,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:56,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-26 01:10:58,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:58,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446733601] [2022-11-26 01:10:58,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446733601] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:10:58,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642663099] [2022-11-26 01:10:58,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:58,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:58,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:58,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:58,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 01:10:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:58,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-26 01:10:58,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:11:00,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:11:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-26 01:11:06,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642663099] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:11:06,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [682584507] [2022-11-26 01:11:06,915 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-26 01:11:06,915 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:11:06,915 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:11:06,916 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:11:06,916 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:11:11,201 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 41 for LOIs [2022-11-26 01:11:11,215 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 39 for LOIs [2022-11-26 01:11:11,228 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 39 for LOIs [2022-11-26 01:11:11,247 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 53 for LOIs [2022-11-26 01:11:11,253 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 39 for LOIs [2022-11-26 01:11:11,265 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:11:16,120 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1109#(and (not (= ~comp_m1_st~0 0)) (<= 0 ~z_val_t~0) (not (= ~d1_ev~0 1)) (= ~comp_m1_i~0 0) (not (= ~d0_ev~0 1)) (= |ULTIMATE.start_stop_simulation_~__retres2~0#1| |ULTIMATE.start_stop_simulation_#res#1|) (not (= ~b0_ev~0 1)) (= ~d1_val_t~0 1) (= |ULTIMATE.start_start_simulation_~tmp~3#1| |ULTIMATE.start_stop_simulation_#res#1|) (not (= ~z_ev~0 1)) (not (= ~b1_ev~0 1)) (not (= ~z_val~0 0)) (= ~b0_val_t~0 1) (= |ULTIMATE.start_eval_~tmp___0~0#1| 0) (= 3 |ULTIMATE.start_start_simulation_~kernel_st~0#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= |ULTIMATE.start_stop_simulation_~__retres2~0#1| 1))' at error location [2022-11-26 01:11:16,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:11:16,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:11:16,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 43 [2022-11-26 01:11:16,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727662952] [2022-11-26 01:11:16,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:11:16,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-26 01:11:16,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:16,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-26 01:11:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=4311, Unknown=0, NotChecked=0, Total=4692 [2022-11-26 01:11:16,126 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 43 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 32 states have internal predecessors, (59), 12 states have call successors, (29), 10 states have call predecessors, (29), 15 states have return successors, (29), 10 states have call predecessors, (29), 12 states have call successors, (29) [2022-11-26 01:11:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:21,916 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2022-11-26 01:11:21,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-26 01:11:21,917 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 32 states have internal predecessors, (59), 12 states have call successors, (29), 10 states have call predecessors, (29), 15 states have return successors, (29), 10 states have call predecessors, (29), 12 states have call successors, (29) Word has length 50 [2022-11-26 01:11:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:21,919 INFO L225 Difference]: With dead ends: 164 [2022-11-26 01:11:21,920 INFO L226 Difference]: Without dead ends: 160 [2022-11-26 01:11:21,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3820 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1173, Invalid=9957, Unknown=0, NotChecked=0, Total=11130 [2022-11-26 01:11:21,926 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 271 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:21,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 275 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-26 01:11:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-26 01:11:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 81. [2022-11-26 01:11:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 18 states have call successors, (18), 16 states have call predecessors, (18), 16 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-26 01:11:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-11-26 01:11:21,955 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 50 [2022-11-26 01:11:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:21,955 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-11-26 01:11:21,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 32 states have internal predecessors, (59), 12 states have call successors, (29), 10 states have call predecessors, (29), 15 states have return successors, (29), 10 states have call predecessors, (29), 12 states have call successors, (29) [2022-11-26 01:11:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-11-26 01:11:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-26 01:11:21,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:21,958 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:11:21,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-26 01:11:22,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:22,164 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:11:22,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:22,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1381260945, now seen corresponding path program 1 times [2022-11-26 01:11:22,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:22,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146371311] [2022-11-26 01:11:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:22,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-26 01:11:23,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:23,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146371311] [2022-11-26 01:11:23,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146371311] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:23,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140112168] [2022-11-26 01:11:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:23,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:23,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:23,098 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:23,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 01:11:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:23,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-26 01:11:23,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-26 01:11:23,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:11:23,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140112168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:11:23,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:11:23,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 22 [2022-11-26 01:11:23,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954161859] [2022-11-26 01:11:23,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:11:23,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 01:11:23,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:23,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 01:11:23,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-11-26 01:11:23,497 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 14 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-26 01:11:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:23,925 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2022-11-26 01:11:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 01:11:23,925 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 77 [2022-11-26 01:11:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:23,931 INFO L225 Difference]: With dead ends: 150 [2022-11-26 01:11:23,931 INFO L226 Difference]: Without dead ends: 90 [2022-11-26 01:11:23,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2022-11-26 01:11:23,936 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:23,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 228 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:11:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-26 01:11:23,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2022-11-26 01:11:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 50 states have (on average 1.1) internal successors, (55), 50 states have internal predecessors, (55), 19 states have call successors, (19), 17 states have call predecessors, (19), 17 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-26 01:11:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2022-11-26 01:11:23,965 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 77 [2022-11-26 01:11:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:23,966 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2022-11-26 01:11:23,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 5 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-26 01:11:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2022-11-26 01:11:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-26 01:11:23,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:23,969 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:11:23,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 01:11:24,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-26 01:11:24,176 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:11:24,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1704345747, now seen corresponding path program 2 times [2022-11-26 01:11:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:24,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945036640] [2022-11-26 01:11:24,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-26 01:11:28,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:28,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945036640] [2022-11-26 01:11:28,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945036640] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:11:28,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710700022] [2022-11-26 01:11:28,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:11:28,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:28,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:28,652 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:28,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 01:11:28,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-26 01:11:28,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:11:28,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-26 01:11:28,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 3 proven. 79 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 01:11:31,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:12:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-26 01:12:07,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710700022] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:12:07,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1410249766] [2022-11-26 01:12:07,574 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-26 01:12:07,575 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:12:07,575 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:12:07,576 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:12:07,576 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:12:13,675 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 41 for LOIs [2022-11-26 01:12:13,684 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 39 for LOIs [2022-11-26 01:12:13,695 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 39 for LOIs [2022-11-26 01:12:13,720 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 53 for LOIs [2022-11-26 01:12:13,728 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 39 for LOIs [2022-11-26 01:12:13,737 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:12:20,167 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2835#(and (not (= ~comp_m1_st~0 0)) (<= 0 ~z_val_t~0) (not (= ~d1_ev~0 1)) (= ~comp_m1_i~0 0) (not (= ~d0_ev~0 1)) (= |ULTIMATE.start_stop_simulation_~__retres2~0#1| |ULTIMATE.start_stop_simulation_#res#1|) (not (= ~b0_ev~0 1)) (= ~d1_val_t~0 1) (= |ULTIMATE.start_start_simulation_~tmp~3#1| |ULTIMATE.start_stop_simulation_#res#1|) (not (= ~z_ev~0 1)) (not (= ~b1_ev~0 1)) (not (= ~z_val~0 0)) (= ~b0_val_t~0 1) (= |ULTIMATE.start_eval_~tmp___0~0#1| 0) (= 3 |ULTIMATE.start_start_simulation_~kernel_st~0#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_stop_simulation_~tmp~2#1| 0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= |ULTIMATE.start_stop_simulation_~__retres2~0#1| 1))' at error location [2022-11-26 01:12:20,167 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:12:20,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:12:20,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 20] total 60 [2022-11-26 01:12:20,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531853185] [2022-11-26 01:12:20,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:12:20,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-26 01:12:20,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:12:20,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-26 01:12:20,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=6853, Unknown=0, NotChecked=0, Total=7310 [2022-11-26 01:12:20,174 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 60 states, 41 states have (on average 2.4390243902439024) internal successors, (100), 43 states have internal predecessors, (100), 17 states have call successors, (48), 14 states have call predecessors, (48), 20 states have return successors, (48), 15 states have call predecessors, (48), 17 states have call successors, (48) [2022-11-26 01:12:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:12:27,585 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2022-11-26 01:12:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-26 01:12:27,586 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 41 states have (on average 2.4390243902439024) internal successors, (100), 43 states have internal predecessors, (100), 17 states have call successors, (48), 14 states have call predecessors, (48), 20 states have return successors, (48), 15 states have call predecessors, (48), 17 states have call successors, (48) Word has length 83 [2022-11-26 01:12:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:12:27,588 INFO L225 Difference]: With dead ends: 168 [2022-11-26 01:12:27,589 INFO L226 Difference]: Without dead ends: 164 [2022-11-26 01:12:27,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 184 SyntacticMatches, 9 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4208 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=1283, Invalid=12523, Unknown=0, NotChecked=0, Total=13806 [2022-11-26 01:12:27,593 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 196 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:12:27,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 300 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-26 01:12:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-26 01:12:27,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 110. [2022-11-26 01:12:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 63 states have internal predecessors, (67), 25 states have call successors, (25), 22 states have call predecessors, (25), 22 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-26 01:12:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2022-11-26 01:12:27,638 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 83 [2022-11-26 01:12:27,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:12:27,639 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2022-11-26 01:12:27,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 41 states have (on average 2.4390243902439024) internal successors, (100), 43 states have internal predecessors, (100), 17 states have call successors, (48), 14 states have call predecessors, (48), 20 states have return successors, (48), 15 states have call predecessors, (48), 17 states have call successors, (48) [2022-11-26 01:12:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-11-26 01:12:27,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-26 01:12:27,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:12:27,641 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:12:27,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-26 01:12:27,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:12:27,851 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:12:27,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:12:27,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1641163072, now seen corresponding path program 3 times [2022-11-26 01:12:27,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:12:27,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583805885] [2022-11-26 01:12:27,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:12:27,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:12:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:12:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 46 proven. 18 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-11-26 01:12:28,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:12:28,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583805885] [2022-11-26 01:12:28,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583805885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:12:28,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826927035] [2022-11-26 01:12:28,509 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:12:28,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:12:28,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:12:28,513 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:12:28,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 01:12:28,723 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:12:28,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:12:28,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-26 01:12:28,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:12:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-26 01:12:28,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:12:28,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826927035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:12:28,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:12:28,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 19 [2022-11-26 01:12:28,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461744330] [2022-11-26 01:12:28,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:12:28,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 01:12:28,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:12:28,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 01:12:28,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-11-26 01:12:28,886 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand has 10 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-11-26 01:12:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:12:29,124 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2022-11-26 01:12:29,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 01:12:29,124 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 110 [2022-11-26 01:12:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:12:29,125 INFO L225 Difference]: With dead ends: 173 [2022-11-26 01:12:29,125 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 01:12:29,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2022-11-26 01:12:29,127 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 23 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:12:29,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 214 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:12:29,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 01:12:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 01:12:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:12:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 01:12:29,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2022-11-26 01:12:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:12:29,129 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 01:12:29,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-11-26 01:12:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 01:12:29,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 01:12:29,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-26 01:12:29,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 01:12:29,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-26 01:12:29,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 01:12:34,112 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 383 398) the Hoare annotation is: (or (not (= ~d0_val_t~0 ~d0_val~0)) (and (not (= 0 |old(~comp_m1_st~0)|)) (not (= 2 |old(~comp_m1_st~0)|))) (= ~comp_m1_st~0 0) (not (= ~b1_val_t~0 1)) (not (= ~d0_val_t~0 1)) (not (= ~b0_val_t~0 ~b0_val~0)) (not (= 0 ~b1_req_up~0)) (not (= ~z_val~0 0)) (not (= ~d1_val_t~0 ~d1_val~0)) (not (= ~d0_req_up~0 0)) (not (= ~b1_val~0 1)) (not (= ~d1_req_up~0 0)) (not (= ~b0_req_up~0 0)) (= 2 ~comp_m1_st~0) (not (= 0 ~z_val_t~0)) (not (= ~d1_val~0 1)) (not (= ~b0_val~0 1))) [2022-11-26 01:12:34,112 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2022-11-26 01:12:34,112 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2022-11-26 01:12:34,112 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 264 278) the Hoare annotation is: true [2022-11-26 01:12:34,113 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 317 349) the Hoare annotation is: (or (not (= ~d0_val_t~0 ~d0_val~0)) (not (= ~b1_val_t~0 1)) (not (= ~d0_val_t~0 1)) (not (= ~b0_val_t~0 ~b0_val~0)) (not (= 0 ~b1_req_up~0)) (= ~b0_ev~0 |old(~b0_ev~0)|) (not (= ~z_val~0 0)) (not (= ~d1_val_t~0 ~d1_val~0)) (not (= ~d0_req_up~0 0)) (not (= ~b1_val~0 1)) (not (= ~d1_req_up~0 0)) (not (= ~b0_req_up~0 0)) (not (= ~d1_val~0 1)) (not (= ~b0_val~0 1))) [2022-11-26 01:12:34,113 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2022-11-26 01:12:34,114 INFO L895 garLoopResultBuilder]: At program point update_channelsENTRY(lines 208 250) the Hoare annotation is: (let ((.cse0 (not (= ~comp_m1_st~0 0)))) (let ((.cse9 (= ~b1_val~0 |old(~b1_val~0)|)) (.cse10 (= ~z_val~0 0)) (.cse3 (not (= |old(~z_val~0)| 0))) (.cse1 (not (= ~d1_val_t~0 1))) (.cse14 (not (= |old(~d0_req_up~0)| 0))) (.cse2 (not (= ~b1_val_t~0 1))) (.cse18 (and .cse0 (not (= 2 ~comp_m1_st~0)))) (.cse4 (not (= ~d0_val_t~0 1))) (.cse19 (not (= |old(~b0_val~0)| ~b0_val_t~0))) (.cse20 (not (= |old(~d0_val~0)| ~d0_val_t~0))) (.cse5 (not (= ~b0_val_t~0 1))) (.cse21 (not (= 0 |old(~b0_req_up~0)|))) (.cse22 (not (= |old(~b1_req_up~0)| 0))) (.cse6 (not (= 0 ~z_val_t~0))) (.cse23 (not (= |old(~d1_req_up~0)| 0))) (.cse24 (not (= ~d1_val_t~0 |old(~d1_val~0)|))) (.cse7 (= ~b0_req_up~0 |old(~b0_req_up~0)|)) (.cse8 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse15 (= ~d1_val_t~0 ~d1_val~0)) (.cse16 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse11 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse12 (= |old(~b0_val~0)| ~b0_val~0)) (.cse17 (= ~d0_req_up~0 0)) (.cse13 (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (and (or .cse0 .cse1 (not (= |old(~z_req_up~0)| 0)) .cse2 (not (= |old(~d0_req_up~0)| 1)) .cse3 .cse4 (not (= |old(~z_req_up~0)| ~comp_m1_i~0)) (not (= |old(~d0_val~0)| 0)) .cse5 (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) (not (= |old(~b1_val~0)| 0)) (not (= |old(~b1_req_up~0)| 1)) .cse6 (and (= |old(~d1_val~0)| ~d1_val~0) .cse7 .cse8 .cse9 (= |old(~d0_req_up~0)| ~d0_req_up~0) .cse10 (= ~d0_val~0 0) .cse11 (= 1 ~b1_req_up~0) .cse12 .cse13)) (or .cse14 .cse2 (not (= |old(~b1_val~0)| 1)) (and .cse7 .cse8 .cse9 .cse15 .cse10 (= |old(~d0_val~0)| ~d0_val~0) .cse16 .cse11 .cse12 .cse17 .cse13) .cse3 .cse18 .cse4 .cse19 (not (= |old(~d1_val~0)| 1)) .cse20 .cse21 .cse22 .cse6 .cse23 .cse24 (not (= |old(~b0_val~0)| 1))) (or .cse1 .cse14 .cse2 .cse18 .cse4 .cse19 .cse20 .cse5 .cse21 .cse22 (not (= ~b1_val_t~0 |old(~b1_val~0)|)) (not (= |old(~z_req_up~0)| 1)) .cse6 .cse23 .cse24 (and (= |old(~z_val~0)| ~z_val~0) .cse7 .cse8 .cse15 .cse16 (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val~0 ~b1_val_t~0) .cse11 .cse12 .cse17 .cse13))))) [2022-11-26 01:12:34,114 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2022-11-26 01:12:34,114 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 350 382) the Hoare annotation is: (or (not (= ~d0_val_t~0 ~d0_val~0)) (not (= ~b1_val_t~0 1)) (not (= ~d0_val_t~0 1)) (not (= ~b0_val_t~0 ~b0_val~0)) (not (= 0 ~b1_req_up~0)) (= ~b0_ev~0 |old(~b0_ev~0)|) (not (= ~z_val~0 0)) (not (= ~d1_val_t~0 ~d1_val~0)) (not (= ~d0_req_up~0 0)) (not (= ~b1_val~0 1)) (not (= ~d1_req_up~0 0)) (not (= ~b0_req_up~0 0)) (not (= ~d1_val~0 1)) (not (= ~b0_val~0 1))) [2022-11-26 01:12:34,115 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2022-11-26 01:12:34,115 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse16 (= ~comp_m1_st~0 0))) (let ((.cse17 (not .cse16))) (let ((.cse0 (= 0 ~z_val_t~0)) (.cse1 (= ~b0_req_up~0 0)) (.cse4 (= |ULTIMATE.start_eval_~tmp___0~0#1| 0)) (.cse2 (= 0 ~b1_req_up~0)) (.cse3 (or .cse17 (= |ULTIMATE.start_eval_~tmp___0~0#1| 1))) (.cse5 (= ~d1_req_up~0 0)) (.cse6 (= ~d1_val_t~0 ~d1_val~0)) (.cse7 (= ~d1_val~0 1)) (.cse8 (= ~b0_val~0 1)) (.cse9 (= ~d0_val_t~0 ~d0_val~0)) (.cse10 (= ~b1_val_t~0 1)) (.cse11 (= ~d0_val_t~0 1)) (.cse12 (= ~b1_val~0 1)) (.cse13 (or .cse16 (= 2 ~comp_m1_st~0))) (.cse14 (= ~b0_val_t~0 ~b0_val~0)) (.cse15 (= ~d0_req_up~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~z_req_up~0 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (or .cse16 .cse4) (or .cse17 (= |exists_runnable_thread_#res| 1)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= ~z_val~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))))) [2022-11-26 01:12:34,115 INFO L899 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2022-11-26 01:12:34,115 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: false [2022-11-26 01:12:34,116 INFO L895 garLoopResultBuilder]: At program point L432-1(lines 429 454) the Hoare annotation is: (let ((.cse0 (= ~b0_req_up~0 0)) (.cse1 (= ~comp_m1_st~0 0)) (.cse2 (= 0 ~b1_req_up~0)) (.cse3 (= ~d1_req_up~0 0)) (.cse4 (= ~d1_val_t~0 ~d1_val~0)) (.cse5 (= ~d1_val~0 1)) (.cse6 (= ~b0_val~0 1)) (.cse7 (= ~z_val~0 0)) (.cse8 (= ~d0_val_t~0 ~d0_val~0)) (.cse9 (= ~b1_val_t~0 1)) (.cse10 (= ~d0_val_t~0 1)) (.cse11 (= ~b1_val~0 1)) (.cse12 (= ~b0_val_t~0 ~b0_val~0)) (.cse13 (= ~d0_req_up~0 0))) (or (and (= 0 ~z_val_t~0) .cse0 .cse1 (= ~z_req_up~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~z_req_up~0 ~comp_m1_i~0) .cse11 .cse12 .cse13) (and (= |ULTIMATE.start_start_simulation_~tmp~3#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (not (= |old(~z_val~0)| ~z_val_t~0)) (= |old(~z_val~0)| ~z_val~0) (not (= |old(~z_req_up~0)| 1))) .cse12 .cse13))) [2022-11-26 01:12:34,116 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2022-11-26 01:12:34,116 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-26 01:12:34,116 INFO L895 garLoopResultBuilder]: At program point L425(line 425) the Hoare annotation is: (and (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (= ~z_req_up~0 0) (= ~d1_val_t~0 1) (= ~b1_val~0 0) (= ~b0_val_t~0 1) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (= ~z_val~0 0) (= ~d0_val~0 0) (= ~b1_val_t~0 1) (= ~d1_req_up~0 1) (= ~d0_val_t~0 1) (= ~z_req_up~0 ~comp_m1_i~0) (= 1 ~b1_req_up~0)) [2022-11-26 01:12:34,117 INFO L895 garLoopResultBuilder]: At program point L425-1(line 425) the Hoare annotation is: (and (= 0 ~z_val_t~0) (= ~b0_req_up~0 0) (= ~comp_m1_st~0 0) (= ~z_req_up~0 0) (= 0 ~b1_req_up~0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~z_req_up~0 ~comp_m1_i~0) (= ~b1_val~0 1) (= ~b0_ev~0 0) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2022-11-26 01:12:34,117 INFO L895 garLoopResultBuilder]: At program point L286(line 286) the Hoare annotation is: (let ((.cse10 (= |ULTIMATE.start_eval_~tmp___0~0#1| 1)) (.cse3 (= 0 ~z_val_t~0)) (.cse0 (= ~b0_req_up~0 0)) (.cse9 (= ~comp_m1_st~0 0)) (.cse4 (= 0 ~b1_req_up~0)) (.cse7 (= ~d1_req_up~0 0)) (.cse8 (= ~d1_val_t~0 ~d1_val~0)) (.cse16 (= ~d1_val~0 1)) (.cse17 (= ~b0_val~0 1)) (.cse6 (= ~z_val~0 0)) (.cse11 (= ~d0_val_t~0 ~d0_val~0)) (.cse12 (= ~b1_val_t~0 1)) (.cse13 (= ~d0_val_t~0 1)) (.cse18 (= ~b1_val~0 1)) (.cse1 (not (= |old(~z_req_up~0)| 1))) (.cse14 (= ~b0_val_t~0 ~b0_val~0)) (.cse15 (= ~d0_req_up~0 0))) (or (let ((.cse5 (= |ULTIMATE.start_eval_~tmp___0~0#1| 0)) (.cse2 (= ~z_req_up~0 1))) (and .cse0 (or (and (not (= |old(~z_val~0)| 0)) .cse1) .cse2 (not .cse3)) (= ~d1_val_t~0 1) .cse4 (or (not .cse5) .cse6) (= ~b0_val_t~0 1) .cse7 .cse8 (or .cse9 (and .cse3 (= 2 ~comp_m1_st~0) .cse2)) (or .cse10 (and .cse3 .cse5 .cse2)) .cse11 (= ~b1_val~0 ~b1_val_t~0) .cse12 .cse13 .cse14 .cse15)) (and .cse0 .cse9 .cse4 (or (and .cse10 .cse16 .cse17 .cse6) (and .cse3 (= ~z_req_up~0 0) .cse16 .cse17 .cse6 (= ~z_req_up~0 ~comp_m1_i~0))) .cse7 .cse8 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15) (and (= |ULTIMATE.start_start_simulation_~tmp~3#1| 0) .cse0 .cse9 .cse4 .cse7 .cse8 .cse16 .cse17 .cse6 .cse11 .cse12 .cse13 .cse18 (or (not (= |old(~z_val~0)| ~z_val_t~0)) (= |old(~z_val~0)| ~z_val~0) .cse1) .cse14 .cse15))) [2022-11-26 01:12:34,117 INFO L895 garLoopResultBuilder]: At program point L311(lines 279 316) the Hoare annotation is: (let ((.cse16 (= ~comp_m1_st~0 0))) (let ((.cse17 (not .cse16))) (let ((.cse0 (= 0 ~z_val_t~0)) (.cse1 (= ~b0_req_up~0 0)) (.cse4 (= |ULTIMATE.start_eval_~tmp___0~0#1| 0)) (.cse2 (= 0 ~b1_req_up~0)) (.cse3 (or .cse17 (= |ULTIMATE.start_eval_~tmp___0~0#1| 1))) (.cse5 (= ~d1_req_up~0 0)) (.cse6 (= ~d1_val_t~0 ~d1_val~0)) (.cse7 (= ~d1_val~0 1)) (.cse8 (= ~b0_val~0 1)) (.cse9 (= ~d0_val_t~0 ~d0_val~0)) (.cse10 (= ~b1_val_t~0 1)) (.cse11 (= ~d0_val_t~0 1)) (.cse12 (= ~b1_val~0 1)) (.cse13 (or .cse16 (= 2 ~comp_m1_st~0))) (.cse14 (= ~b0_val_t~0 ~b0_val~0)) (.cse15 (= ~d0_req_up~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~z_req_up~0 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (or .cse16 .cse4) (or .cse17 (= |exists_runnable_thread_#res| 1)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= ~z_val~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))))) [2022-11-26 01:12:34,118 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2022-11-26 01:12:34,118 INFO L902 garLoopResultBuilder]: At program point L501-2(lines 501 507) the Hoare annotation is: true [2022-11-26 01:12:34,118 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (and (= 0 ~z_val_t~0) (= ~b0_req_up~0 0) (= ~z_req_up~0 0) (= 0 ~b1_req_up~0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~z_req_up~0 ~comp_m1_i~0) (= ~b1_val~0 1) (or (= ~comp_m1_st~0 0) (= 2 ~comp_m1_st~0)) (= ~b0_ev~0 0) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2022-11-26 01:12:34,118 INFO L895 garLoopResultBuilder]: At program point L427-1(line 427) the Hoare annotation is: (and (= 0 ~z_val_t~0) (= ~b0_req_up~0 0) (= ~z_req_up~0 0) (= ~b0_ev~0 1) (= 0 ~b1_req_up~0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~z_req_up~0 ~comp_m1_i~0) (= ~b1_val~0 1) (or (= ~comp_m1_st~0 0) (= 2 ~comp_m1_st~0)) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2022-11-26 01:12:34,119 INFO L895 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse10 (= |ULTIMATE.start_eval_~tmp___0~0#1| 1)) (.cse3 (= 0 ~z_val_t~0)) (.cse0 (= ~b0_req_up~0 0)) (.cse9 (= ~comp_m1_st~0 0)) (.cse4 (= 0 ~b1_req_up~0)) (.cse7 (= ~d1_req_up~0 0)) (.cse8 (= ~d1_val_t~0 ~d1_val~0)) (.cse16 (= ~d1_val~0 1)) (.cse17 (= ~b0_val~0 1)) (.cse6 (= ~z_val~0 0)) (.cse11 (= ~d0_val_t~0 ~d0_val~0)) (.cse12 (= ~b1_val_t~0 1)) (.cse13 (= ~d0_val_t~0 1)) (.cse18 (= ~b1_val~0 1)) (.cse1 (not (= |old(~z_req_up~0)| 1))) (.cse14 (= ~b0_val_t~0 ~b0_val~0)) (.cse15 (= ~d0_req_up~0 0))) (or (let ((.cse5 (= |ULTIMATE.start_eval_~tmp___0~0#1| 0)) (.cse2 (= ~z_req_up~0 1))) (and .cse0 (or (and (not (= |old(~z_val~0)| 0)) .cse1) .cse2 (not .cse3)) (= ~d1_val_t~0 1) .cse4 (or (not .cse5) .cse6) (= ~b0_val_t~0 1) .cse7 .cse8 (or .cse9 (and .cse3 (= 2 ~comp_m1_st~0) .cse2)) (or .cse10 (and .cse3 .cse5 .cse2)) .cse11 (= ~b1_val~0 ~b1_val_t~0) .cse12 .cse13 .cse14 .cse15)) (and .cse0 .cse9 .cse4 (or (and .cse10 .cse16 .cse17 .cse6) (and .cse3 (= ~z_req_up~0 0) .cse16 .cse17 .cse6 (= ~z_req_up~0 ~comp_m1_i~0))) .cse7 .cse8 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15) (and (= |ULTIMATE.start_start_simulation_~tmp~3#1| 0) .cse0 .cse9 .cse4 .cse7 .cse8 .cse16 .cse17 .cse6 .cse11 .cse12 .cse13 .cse18 (or (not (= |old(~z_val~0)| ~z_val_t~0)) (= |old(~z_val~0)| ~z_val~0) .cse1) .cse14 .cse15))) [2022-11-26 01:12:34,119 INFO L895 garLoopResultBuilder]: At program point L444(line 444) the Hoare annotation is: (let ((.cse0 (= ~comp_m1_st~0 0))) (let ((.cse1 (not .cse0))) (and (= ~b0_req_up~0 0) (or .cse0 (= |ULTIMATE.start_eval_~tmp___0~0#1| 0)) (or .cse1 (= |exists_runnable_thread_#res| 1)) (= 0 ~b1_req_up~0) (or .cse1 (= |ULTIMATE.start_eval_~tmp___0~0#1| 1)) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~b1_val~0 1) (or (not (= |old(~z_val~0)| ~z_val_t~0)) (= |old(~z_val~0)| ~z_val~0) (not (= |old(~z_req_up~0)| 1))) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)))) [2022-11-26 01:12:34,119 INFO L895 garLoopResultBuilder]: At program point L444-1(line 444) the Hoare annotation is: (let ((.cse0 (= ~comp_m1_st~0 0))) (let ((.cse1 (not .cse0))) (and (= ~b0_req_up~0 0) (or .cse0 (= |ULTIMATE.start_eval_~tmp___0~0#1| 0)) (or .cse1 (= |exists_runnable_thread_#res| 1)) (= 0 ~b1_req_up~0) (or .cse1 (= |ULTIMATE.start_eval_~tmp___0~0#1| 1)) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~b1_val~0 1) (or (not (= |old(~z_val~0)| ~z_val_t~0)) (= |old(~z_val~0)| ~z_val~0) (not (= |old(~z_req_up~0)| 1))) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)))) [2022-11-26 01:12:34,120 INFO L895 garLoopResultBuilder]: At program point L428(line 428) the Hoare annotation is: (and (= 0 ~z_val_t~0) (= ~b0_req_up~0 0) (= ~comp_m1_st~0 0) (= ~z_req_up~0 0) (= ~b0_ev~0 1) (= 0 ~b1_req_up~0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~z_req_up~0 ~comp_m1_i~0) (= ~b1_val~0 1) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2022-11-26 01:12:34,120 INFO L899 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2022-11-26 01:12:34,120 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (and (= ~b0_req_up~0 0) (= 0 ~b1_req_up~0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~b1_val~0 1) (or (not (= |old(~z_val~0)| ~z_val_t~0)) (= |old(~z_val~0)| ~z_val~0) (not (= |old(~z_req_up~0)| 1))) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2022-11-26 01:12:34,120 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-11-26 01:12:34,121 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 01:12:34,121 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2022-11-26 01:12:34,121 INFO L895 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (and (= ~b0_req_up~0 0) (= 0 ~b1_req_up~0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~b1_val~0 1) (or (not (= |old(~z_val~0)| ~z_val_t~0)) (= |old(~z_val~0)| ~z_val~0) (not (= |old(~z_req_up~0)| 1))) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2022-11-26 01:12:34,121 INFO L895 garLoopResultBuilder]: At program point L405-1(line 405) the Hoare annotation is: (and (= ~b0_req_up~0 0) (= 0 ~b1_req_up~0) (let ((.cse0 (= ~comp_m1_st~0 0))) (or (and .cse0 (= |ULTIMATE.start_stop_simulation_#t~ret7#1| 1)) (and (not .cse0) (= |ULTIMATE.start_stop_simulation_#t~ret7#1| 0)))) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (= ~z_val~0 0) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~b1_val~0 1) (or (not (= |old(~z_val~0)| ~z_val_t~0)) (= |old(~z_val~0)| ~z_val~0) (not (= |old(~z_req_up~0)| 1))) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)) [2022-11-26 01:12:34,122 INFO L895 garLoopResultBuilder]: At program point L455(lines 418 460) the Hoare annotation is: (let ((.cse0 (= 0 ~z_val_t~0)) (.cse1 (= ~z_val~0 0))) (or (and .cse0 (= ~z_req_up~0 0) .cse1 (= ~z_req_up~0 ~comp_m1_i~0)) (and .cse0 .cse1 (or (= |ULTIMATE.start_eval_~tmp___0~0#1| 1) (= |ULTIMATE.start_eval_~tmp___0~0#1| 0)) (or (= ~comp_m1_st~0 0) (= 2 ~comp_m1_st~0))) (and (= ~b0_req_up~0 0) (= 0 ~b1_req_up~0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) .cse1 (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~b1_val~0 1) (or (not (= |old(~z_val~0)| ~z_val_t~0)) (= |old(~z_val~0)| ~z_val~0) (not (= |old(~z_req_up~0)| 1))) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0)))) [2022-11-26 01:12:34,122 INFO L895 garLoopResultBuilder]: At program point L290(lines 290 294) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_eval_~tmp___0~0#1| 1)) (.cse3 (= ~z_req_up~0 1)) (.cse2 (= 0 ~z_val_t~0)) (.cse1 (= ~comp_m1_st~0 0))) (and (or (and .cse0 .cse1) (and (not .cse1) (= |ULTIMATE.start_eval_~tmp___0~0#1| 0))) (= ~b0_req_up~0 0) (or .cse0 (and .cse2 .cse3)) (= 0 ~b1_req_up~0) (= ~d1_req_up~0 0) (= ~d1_val_t~0 ~d1_val~0) (= ~d1_val~0 1) (= ~b0_val~0 1) (or (and (not (= |old(~z_val~0)| 0)) (not (= |old(~z_req_up~0)| 1))) (= ~z_val~0 0) .cse3 (not .cse2)) (= ~d0_val_t~0 ~d0_val~0) (= ~b1_val_t~0 1) (= ~d0_val_t~0 1) (= ~b1_val~0 1) (or .cse1 (= 2 ~comp_m1_st~0)) (= ~b0_val_t~0 ~b0_val~0) (= ~d0_req_up~0 0))) [2022-11-26 01:12:34,125 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2022-11-26 01:12:34,127 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 01:12:34,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 01:12:34 BoogieIcfgContainer [2022-11-26 01:12:34,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 01:12:34,192 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 01:12:34,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 01:12:34,203 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 01:12:34,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:10:33" (3/4) ... [2022-11-26 01:12:34,206 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 01:12:34,212 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-26 01:12:34,212 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-26 01:12:34,213 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-26 01:12:34,213 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-26 01:12:34,213 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-26 01:12:34,220 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2022-11-26 01:12:34,224 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-11-26 01:12:34,224 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-26 01:12:34,225 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 01:12:34,254 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(comp_m1_st == 0) || !(d1_val_t == 1)) || !(\old(z_req_up) == 0)) || !(b1_val_t == 1)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(d0_val_t == 1)) || !(\old(z_req_up) == comp_m1_i)) || !(\old(d0_val) == 0)) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_val) == 0)) || !(\old(b1_req_up) == 1)) || !(0 == z_val_t)) || ((((((((((\old(d1_val) == d1_val && b0_req_up == \old(b0_req_up)) && b0_ev == \old(b0_ev)) && b1_val == \old(b1_val)) && \old(d0_req_up) == d0_req_up) && z_val == 0) && d0_val == 0) && \old(z_req_up) == z_req_up) && 1 == b1_req_up) && \old(b0_val) == b0_val) && d1_req_up == \old(d1_req_up))) && (((((((((((((((!(\old(d0_req_up) == 0) || !(b1_val_t == 1)) || !(\old(b1_val) == 1)) || ((((((((((b0_req_up == \old(b0_req_up) && b0_ev == \old(b0_ev)) && b1_val == \old(b1_val)) && d1_val_t == d1_val) && z_val == 0) && \old(d0_val) == d0_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b0_val) == b0_val) && d0_req_up == 0) && d1_req_up == \old(d1_req_up))) || !(\old(z_val) == 0)) || (!(comp_m1_st == 0) && !(2 == comp_m1_st))) || !(d0_val_t == 1)) || !(\old(b0_val) == b0_val_t)) || !(\old(d1_val) == 1)) || !(\old(d0_val) == d0_val_t)) || !(0 == \old(b0_req_up))) || !(\old(b1_req_up) == 0)) || !(0 == z_val_t)) || !(\old(d1_req_up) == 0)) || !(d1_val_t == \old(d1_val))) || !(\old(b0_val) == 1))) && (((((((((((((((!(d1_val_t == 1) || !(\old(d0_req_up) == 0)) || !(b1_val_t == 1)) || (!(comp_m1_st == 0) && !(2 == comp_m1_st))) || !(d0_val_t == 1)) || !(\old(b0_val) == b0_val_t)) || !(\old(d0_val) == d0_val_t)) || !(b0_val_t == 1)) || !(0 == \old(b0_req_up))) || !(\old(b1_req_up) == 0)) || !(b1_val_t == \old(b1_val))) || !(\old(z_req_up) == 1)) || !(0 == z_val_t)) || !(\old(d1_req_up) == 0)) || !(d1_val_t == \old(d1_val))) || ((((((((((\old(z_val) == z_val && b0_req_up == \old(b0_req_up)) && b0_ev == \old(b0_ev)) && d1_val_t == d1_val) && \old(b1_req_up) == b1_req_up) && d0_val_t == d0_val) && b1_val == b1_val_t) && \old(z_req_up) == z_req_up) && \old(b0_val) == b0_val) && d0_req_up == 0) && d1_req_up == \old(d1_req_up))) [2022-11-26 01:12:34,255 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(d0_val_t == d0_val) || (!(0 == \old(comp_m1_st)) && !(2 == \old(comp_m1_st)))) || comp_m1_st == 0) || !(b1_val_t == 1)) || !(d0_val_t == 1)) || !(b0_val_t == b0_val)) || !(0 == b1_req_up)) || !(z_val == 0)) || !(d1_val_t == d1_val)) || !(d0_req_up == 0)) || !(b1_val == 1)) || !(d1_req_up == 0)) || !(b0_req_up == 0)) || 2 == comp_m1_st) || !(0 == z_val_t)) || !(d1_val == 1)) || !(b0_val == 1) [2022-11-26 01:12:34,256 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == z_val_t && b0_req_up == 0) && comp_m1_st == 0) && z_req_up == 0) && 0 == b1_req_up) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && z_req_up == comp_m1_i) && b1_val == 1) && b0_val_t == b0_val) && d0_req_up == 0) || (((((((((((((((tmp == 0 && b0_req_up == 0) && comp_m1_st == 0) && 0 == b1_req_up) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && ((!(\old(z_val) == z_val_t) || \old(z_val) == z_val) || !(\old(z_req_up) == 1))) && b0_val_t == b0_val) && d0_req_up == 0) [2022-11-26 01:12:34,256 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == z_val_t && z_req_up == 0) && z_val == 0) && z_req_up == comp_m1_i) || (((0 == z_val_t && z_val == 0) && (tmp___0 == 1 || tmp___0 == 0)) && (comp_m1_st == 0 || 2 == comp_m1_st))) || (((((((((((((b0_req_up == 0 && 0 == b1_req_up) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && ((!(\old(z_val) == z_val_t) || \old(z_val) == z_val) || !(\old(z_req_up) == 1))) && b0_val_t == b0_val) && d0_req_up == 0) [2022-11-26 01:12:34,257 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((b0_req_up == 0 && (((!(\old(z_val) == 0) && !(\old(z_req_up) == 1)) || z_req_up == 1) || !(0 == z_val_t))) && d1_val_t == 1) && 0 == b1_req_up) && (!(tmp___0 == 0) || z_val == 0)) && b0_val_t == 1) && d1_req_up == 0) && d1_val_t == d1_val) && (comp_m1_st == 0 || ((0 == z_val_t && 2 == comp_m1_st) && z_req_up == 1))) && (tmp___0 == 1 || ((0 == z_val_t && tmp___0 == 0) && z_req_up == 1))) && d0_val_t == d0_val) && b1_val == b1_val_t) && b1_val_t == 1) && d0_val_t == 1) && b0_val_t == b0_val) && d0_req_up == 0) || (((((((((((b0_req_up == 0 && comp_m1_st == 0) && 0 == b1_req_up) && ((((tmp___0 == 1 && d1_val == 1) && b0_val == 1) && z_val == 0) || (((((0 == z_val_t && z_req_up == 0) && d1_val == 1) && b0_val == 1) && z_val == 0) && z_req_up == comp_m1_i))) && d1_req_up == 0) && d1_val_t == d1_val) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && b0_val_t == b0_val) && d0_req_up == 0)) || (((((((((((((((tmp == 0 && b0_req_up == 0) && comp_m1_st == 0) && 0 == b1_req_up) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && ((!(\old(z_val) == z_val_t) || \old(z_val) == z_val) || !(\old(z_req_up) == 1))) && b0_val_t == b0_val) && d0_req_up == 0) [2022-11-26 01:12:34,257 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == z_val_t && b0_req_up == 0) && 0 == b1_req_up) && (!(comp_m1_st == 0) || tmp___0 == 1)) && tmp___0 == 0) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_req_up == 1) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && (comp_m1_st == 0 || 2 == comp_m1_st)) && b0_val_t == b0_val) && d0_req_up == 0) || (((((((((((((((((0 == z_val_t && b0_req_up == 0) && (comp_m1_st == 0 || tmp___0 == 0)) && (!(comp_m1_st == 0) || \result == 1)) && 0 == b1_req_up) && (!(comp_m1_st == 0) || tmp___0 == 1)) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && (comp_m1_st == 0 || 2 == comp_m1_st)) && b0_val_t == b0_val) && d0_req_up == 0) [2022-11-26 01:12:34,258 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((tmp___0 == 1 && comp_m1_st == 0) || (!(comp_m1_st == 0) && tmp___0 == 0)) && b0_req_up == 0) && (tmp___0 == 1 || (0 == z_val_t && z_req_up == 1))) && 0 == b1_req_up) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && ((((!(\old(z_val) == 0) && !(\old(z_req_up) == 1)) || z_val == 0) || z_req_up == 1) || !(0 == z_val_t))) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && (comp_m1_st == 0 || 2 == comp_m1_st)) && b0_val_t == b0_val) && d0_req_up == 0 [2022-11-26 01:12:34,258 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((b0_req_up == 0 && 0 == b1_req_up) && ((comp_m1_st == 0 && aux-\exists_runnable_thread()-aux == 1) || (!(comp_m1_st == 0) && aux-\exists_runnable_thread()-aux == 0))) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && ((!(\old(z_val) == z_val_t) || \old(z_val) == z_val) || !(\old(z_req_up) == 1))) && b0_val_t == b0_val) && d0_req_up == 0 [2022-11-26 01:12:34,304 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 01:12:34,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 01:12:34,307 INFO L158 Benchmark]: Toolchain (without parser) took 122115.49ms. Allocated memory was 132.1MB in the beginning and 746.6MB in the end (delta: 614.5MB). Free memory was 89.4MB in the beginning and 597.4MB in the end (delta: -508.0MB). Peak memory consumption was 108.8MB. Max. memory is 16.1GB. [2022-11-26 01:12:34,307 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 132.1MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 01:12:34,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.59ms. Allocated memory is still 132.1MB. Free memory was 89.0MB in the beginning and 76.0MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-26 01:12:34,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.51ms. Allocated memory is still 132.1MB. Free memory was 75.8MB in the beginning and 73.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 01:12:34,308 INFO L158 Benchmark]: Boogie Preprocessor took 27.01ms. Allocated memory is still 132.1MB. Free memory was 73.5MB in the beginning and 71.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 01:12:34,309 INFO L158 Benchmark]: RCFGBuilder took 890.38ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 71.8MB in the beginning and 121.8MB in the end (delta: -50.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2022-11-26 01:12:34,309 INFO L158 Benchmark]: TraceAbstraction took 120676.65ms. Allocated memory was 178.3MB in the beginning and 746.6MB in the end (delta: 568.3MB). Free memory was 121.8MB in the beginning and 603.7MB in the end (delta: -481.9MB). Peak memory consumption was 433.5MB. Max. memory is 16.1GB. [2022-11-26 01:12:34,310 INFO L158 Benchmark]: Witness Printer took 113.87ms. Allocated memory is still 746.6MB. Free memory was 603.7MB in the beginning and 597.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-26 01:12:34,312 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 132.1MB. Free memory is still 103.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.59ms. Allocated memory is still 132.1MB. Free memory was 89.0MB in the beginning and 76.0MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.51ms. Allocated memory is still 132.1MB. Free memory was 75.8MB in the beginning and 73.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.01ms. Allocated memory is still 132.1MB. Free memory was 73.5MB in the beginning and 71.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 890.38ms. Allocated memory was 132.1MB in the beginning and 178.3MB in the end (delta: 46.1MB). Free memory was 71.8MB in the beginning and 121.8MB in the end (delta: -50.0MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * TraceAbstraction took 120676.65ms. Allocated memory was 178.3MB in the beginning and 746.6MB in the end (delta: 568.3MB). Free memory was 121.8MB in the beginning and 603.7MB in the end (delta: -481.9MB). Peak memory consumption was 433.5MB. Max. memory is 16.1GB. * Witness Printer took 113.87ms. Allocated memory is still 746.6MB. Free memory was 603.7MB in the beginning and 597.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 120.5s, OverallIterations: 6, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 632 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 612 mSDsluCounter, 1139 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 966 mSDsCounter, 1015 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2953 IncrementalHoareTripleChecker+Invalid, 3968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1015 mSolverCounterUnsat, 173 mSDtfsCounter, 2953 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 895 GetRequests, 556 SyntacticMatches, 15 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9223 ImplicationChecksByTransitivity, 42.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=5, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 145 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 78 PreInvPairs, 116 NumberOfFragments, 2078 HoareAnnotationTreeSize, 78 FomulaSimplifications, 3015 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 25 FomulaSimplificationsInter, 13341 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 57.2s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 20590 SizeOfPredicates, 123 NumberOfNonLiveVariables, 2737 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 584/839 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((((0 == z_val_t && z_req_up == 0) && z_val == 0) && z_req_up == comp_m1_i) || (((0 == z_val_t && z_val == 0) && (tmp___0 == 1 || tmp___0 == 0)) && (comp_m1_st == 0 || 2 == comp_m1_st))) || (((((((((((((b0_req_up == 0 && 0 == b1_req_up) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && ((!(\old(z_val) == z_val_t) || \old(z_val) == z_val) || !(\old(z_req_up) == 1))) && b0_val_t == b0_val) && d0_req_up == 0) - InvariantResult [Line: 501]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: ((((((((((((((((b0_req_up == 0 && (((!(\old(z_val) == 0) && !(\old(z_req_up) == 1)) || z_req_up == 1) || !(0 == z_val_t))) && d1_val_t == 1) && 0 == b1_req_up) && (!(tmp___0 == 0) || z_val == 0)) && b0_val_t == 1) && d1_req_up == 0) && d1_val_t == d1_val) && (comp_m1_st == 0 || ((0 == z_val_t && 2 == comp_m1_st) && z_req_up == 1))) && (tmp___0 == 1 || ((0 == z_val_t && tmp___0 == 0) && z_req_up == 1))) && d0_val_t == d0_val) && b1_val == b1_val_t) && b1_val_t == 1) && d0_val_t == 1) && b0_val_t == b0_val) && d0_req_up == 0) || (((((((((((b0_req_up == 0 && comp_m1_st == 0) && 0 == b1_req_up) && ((((tmp___0 == 1 && d1_val == 1) && b0_val == 1) && z_val == 0) || (((((0 == z_val_t && z_req_up == 0) && d1_val == 1) && b0_val == 1) && z_val == 0) && z_req_up == comp_m1_i))) && d1_req_up == 0) && d1_val_t == d1_val) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && b0_val_t == b0_val) && d0_req_up == 0)) || (((((((((((((((tmp == 0 && b0_req_up == 0) && comp_m1_st == 0) && 0 == b1_req_up) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && ((!(\old(z_val) == z_val_t) || \old(z_val) == z_val) || !(\old(z_req_up) == 1))) && b0_val_t == b0_val) && d0_req_up == 0) - InvariantResult [Line: 429]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == z_val_t && b0_req_up == 0) && comp_m1_st == 0) && z_req_up == 0) && 0 == b1_req_up) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && z_req_up == comp_m1_i) && b1_val == 1) && b0_val_t == b0_val) && d0_req_up == 0) || (((((((((((((((tmp == 0 && b0_req_up == 0) && comp_m1_st == 0) && 0 == b1_req_up) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && ((!(\old(z_val) == z_val_t) || \old(z_val) == z_val) || !(\old(z_req_up) == 1))) && b0_val_t == b0_val) && d0_req_up == 0) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((tmp___0 == 1 && comp_m1_st == 0) || (!(comp_m1_st == 0) && tmp___0 == 0)) && b0_req_up == 0) && (tmp___0 == 1 || (0 == z_val_t && z_req_up == 1))) && 0 == b1_req_up) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && ((((!(\old(z_val) == 0) && !(\old(z_req_up) == 1)) || z_val == 0) || z_req_up == 1) || !(0 == z_val_t))) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && (comp_m1_st == 0 || 2 == comp_m1_st)) && b0_val_t == b0_val) && d0_req_up == 0 - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((((((((((((b0_req_up == 0 && 0 == b1_req_up) && ((comp_m1_st == 0 && aux-\exists_runnable_thread()-aux == 1) || (!(comp_m1_st == 0) && aux-\exists_runnable_thread()-aux == 0))) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && ((!(\old(z_val) == z_val_t) || \old(z_val) == z_val) || !(\old(z_req_up) == 1))) && b0_val_t == b0_val) && d0_req_up == 0 - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == z_val_t && b0_req_up == 0) && comp_m1_st == 0) && z_req_up == 0) && 0 == b1_req_up) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && z_req_up == comp_m1_i) && b1_val == 1) && b0_ev == 0) && b0_val_t == b0_val) && d0_req_up == 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (((((((((((((((!(d0_val_t == d0_val) || (!(0 == \old(comp_m1_st)) && !(2 == \old(comp_m1_st)))) || comp_m1_st == 0) || !(b1_val_t == 1)) || !(d0_val_t == 1)) || !(b0_val_t == b0_val)) || !(0 == b1_req_up)) || !(z_val == 0)) || !(d1_val_t == d1_val)) || !(d0_req_up == 0)) || !(b1_val == 1)) || !(d1_req_up == 0)) || !(b0_req_up == 0)) || 2 == comp_m1_st) || !(0 == z_val_t)) || !(d1_val == 1)) || !(b0_val == 1) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == z_val_t && b0_req_up == 0) && 0 == b1_req_up) && (!(comp_m1_st == 0) || tmp___0 == 1)) && tmp___0 == 0) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_req_up == 1) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && (comp_m1_st == 0 || 2 == comp_m1_st)) && b0_val_t == b0_val) && d0_req_up == 0) || (((((((((((((((((0 == z_val_t && b0_req_up == 0) && (comp_m1_st == 0 || tmp___0 == 0)) && (!(comp_m1_st == 0) || \result == 1)) && 0 == b1_req_up) && (!(comp_m1_st == 0) || tmp___0 == 1)) && d1_req_up == 0) && d1_val_t == d1_val) && d1_val == 1) && b0_val == 1) && z_val == 0) && d0_val_t == d0_val) && b1_val_t == 1) && d0_val_t == 1) && b1_val == 1) && (comp_m1_st == 0 || 2 == comp_m1_st)) && b0_val_t == b0_val) && d0_req_up == 0) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((((((((((((((((!(comp_m1_st == 0) || !(d1_val_t == 1)) || !(\old(z_req_up) == 0)) || !(b1_val_t == 1)) || !(\old(d0_req_up) == 1)) || !(\old(z_val) == 0)) || !(d0_val_t == 1)) || !(\old(z_req_up) == comp_m1_i)) || !(\old(d0_val) == 0)) || !(b0_val_t == 1)) || !(\old(b0_req_up) == 1)) || !(\old(d1_req_up) == 1)) || !(\old(b0_val) == 0)) || !(\old(b1_val) == 0)) || !(\old(b1_req_up) == 1)) || !(0 == z_val_t)) || ((((((((((\old(d1_val) == d1_val && b0_req_up == \old(b0_req_up)) && b0_ev == \old(b0_ev)) && b1_val == \old(b1_val)) && \old(d0_req_up) == d0_req_up) && z_val == 0) && d0_val == 0) && \old(z_req_up) == z_req_up) && 1 == b1_req_up) && \old(b0_val) == b0_val) && d1_req_up == \old(d1_req_up))) && (((((((((((((((!(\old(d0_req_up) == 0) || !(b1_val_t == 1)) || !(\old(b1_val) == 1)) || ((((((((((b0_req_up == \old(b0_req_up) && b0_ev == \old(b0_ev)) && b1_val == \old(b1_val)) && d1_val_t == d1_val) && z_val == 0) && \old(d0_val) == d0_val) && \old(b1_req_up) == b1_req_up) && \old(z_req_up) == z_req_up) && \old(b0_val) == b0_val) && d0_req_up == 0) && d1_req_up == \old(d1_req_up))) || !(\old(z_val) == 0)) || (!(comp_m1_st == 0) && !(2 == comp_m1_st))) || !(d0_val_t == 1)) || !(\old(b0_val) == b0_val_t)) || !(\old(d1_val) == 1)) || !(\old(d0_val) == d0_val_t)) || !(0 == \old(b0_req_up))) || !(\old(b1_req_up) == 0)) || !(0 == z_val_t)) || !(\old(d1_req_up) == 0)) || !(d1_val_t == \old(d1_val))) || !(\old(b0_val) == 1))) && (((((((((((((((!(d1_val_t == 1) || !(\old(d0_req_up) == 0)) || !(b1_val_t == 1)) || (!(comp_m1_st == 0) && !(2 == comp_m1_st))) || !(d0_val_t == 1)) || !(\old(b0_val) == b0_val_t)) || !(\old(d0_val) == d0_val_t)) || !(b0_val_t == 1)) || !(0 == \old(b0_req_up))) || !(\old(b1_req_up) == 0)) || !(b1_val_t == \old(b1_val))) || !(\old(z_req_up) == 1)) || !(0 == z_val_t)) || !(\old(d1_req_up) == 0)) || !(d1_val_t == \old(d1_val))) || ((((((((((\old(z_val) == z_val && b0_req_up == \old(b0_req_up)) && b0_ev == \old(b0_ev)) && d1_val_t == d1_val) && \old(b1_req_up) == b1_req_up) && d0_val_t == d0_val) && b1_val == b1_val_t) && \old(z_req_up) == z_req_up) && \old(b0_val) == b0_val) && d0_req_up == 0) && d1_req_up == \old(d1_req_up))) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-26 01:12:34,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_896d48c7-b9e2-4af9-bac5-f60f66d5e5a7/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE