./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW --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 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- 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-4e7fbc6 [2022-11-23 15:01:50,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:01:50,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:01:50,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:01:50,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:01:50,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:01:50,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:01:50,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:01:50,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:01:50,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:01:50,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:01:50,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:01:50,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:01:50,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:01:50,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:01:50,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:01:50,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:01:50,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:01:50,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:01:50,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:01:50,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:01:50,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:01:50,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:01:50,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:01:50,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:01:50,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:01:50,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:01:50,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:01:50,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:01:50,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:01:50,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:01:50,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:01:50,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:01:50,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:01:50,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:01:50,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:01:50,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:01:50,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:01:50,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:01:50,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:01:50,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:01:50,587 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 15:01:50,611 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:01:50,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:01:50,612 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:01:50,612 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:01:50,613 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:01:50,613 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:01:50,613 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:01:50,614 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:01:50,614 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:01:50,614 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:01:50,614 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:01:50,615 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:01:50,615 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:01:50,615 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:01:50,616 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:01:50,616 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:01:50,616 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:01:50,616 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:01:50,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:01:50,617 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:01:50,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:01:50,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:01:50,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:01:50,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 15:01:50,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:01:50,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 15:01:50,619 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:01:50,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 15:01:50,620 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:01:50,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 15:01:50,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:01:50,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:01:50,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:01:50,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:01:50,621 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:01:50,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:01:50,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 15:01:50,622 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:01:50,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:01:50,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 15:01:50,623 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:01:50,623 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_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/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_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW 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 -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2022-11-23 15:01:50,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:01:50,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:01:50,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:01:50,955 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:01:50,958 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:01:50,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2022-11-23 15:01:54,103 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:01:54,333 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:01:54,334 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2022-11-23 15:01:54,342 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/data/8e1362e7a/7c6c287ad892447b865287743636c4c0/FLAG952033cde [2022-11-23 15:01:54,356 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/data/8e1362e7a/7c6c287ad892447b865287743636c4c0 [2022-11-23 15:01:54,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:01:54,360 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:01:54,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:01:54,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:01:54,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:01:54,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:01:54" (1/1) ... [2022-11-23 15:01:54,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715942d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54, skipping insertion in model container [2022-11-23 15:01:54,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:01:54" (1/1) ... [2022-11-23 15:01:54,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:01:54,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:01:54,536 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_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2022-11-23 15:01:54,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:01:54,589 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:01:54,601 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_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2022-11-23 15:01:54,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:01:54,635 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:01:54,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54 WrapperNode [2022-11-23 15:01:54,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:01:54,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:01:54,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:01:54,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:01:54,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54" (1/1) ... [2022-11-23 15:01:54,650 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54" (1/1) ... [2022-11-23 15:01:54,673 INFO L138 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 202 [2022-11-23 15:01:54,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:01:54,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:01:54,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:01:54,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:01:54,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54" (1/1) ... [2022-11-23 15:01:54,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54" (1/1) ... [2022-11-23 15:01:54,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54" (1/1) ... [2022-11-23 15:01:54,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54" (1/1) ... [2022-11-23 15:01:54,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54" (1/1) ... [2022-11-23 15:01:54,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54" (1/1) ... [2022-11-23 15:01:54,702 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54" (1/1) ... [2022-11-23 15:01:54,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54" (1/1) ... [2022-11-23 15:01:54,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:01:54,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:01:54,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:01:54,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:01:54,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54" (1/1) ... [2022-11-23 15:01:54,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:01:54,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:01:54,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:01:54,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:01:54,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:01:54,813 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-23 15:01:54,813 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-23 15:01:54,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:01:54,813 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-23 15:01:54,813 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-23 15:01:54,813 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-11-23 15:01:54,814 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-11-23 15:01:54,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:01:54,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:01:54,943 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:01:54,945 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:01:55,305 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:01:55,416 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:01:55,421 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-23 15:01:55,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:01:55 BoogieIcfgContainer [2022-11-23 15:01:55,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:01:55,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:01:55,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:01:55,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:01:55,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:01:54" (1/3) ... [2022-11-23 15:01:55,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f35fc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:01:55, skipping insertion in model container [2022-11-23 15:01:55,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:01:54" (2/3) ... [2022-11-23 15:01:55,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f35fc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:01:55, skipping insertion in model container [2022-11-23 15:01:55,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:01:55" (3/3) ... [2022-11-23 15:01:55,446 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2022-11-23 15:01:55,472 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:01:55,473 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 15:01:55,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:01:55,528 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;@4b4479b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:01:55,528 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 15:01:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 40 states have (on average 1.575) internal successors, (63), 43 states have internal predecessors, (63), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 15:01:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 15:01:55,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:01:55,543 INFO L195 NwaCegarLoop]: trace histogram [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-23 15:01:55,544 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:01:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:01:55,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1268551181, now seen corresponding path program 1 times [2022-11-23 15:01:55,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:01:55,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109220093] [2022-11-23 15:01:55,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:01:55,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:01:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:01:55,896 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-23 15:01:55,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:01:55,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109220093] [2022-11-23 15:01:55,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109220093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:01:55,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:01:55,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:01:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388325778] [2022-11-23 15:01:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:01:55,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:01:55,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:01:55,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:01:55,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:01:55,966 INFO L87 Difference]: Start difference. First operand has 51 states, 40 states have (on average 1.575) internal successors, (63), 43 states have internal predecessors, (63), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:01:56,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:01:56,057 INFO L93 Difference]: Finished difference Result 140 states and 208 transitions. [2022-11-23 15:01:56,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:01:56,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-11-23 15:01:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:01:56,070 INFO L225 Difference]: With dead ends: 140 [2022-11-23 15:01:56,070 INFO L226 Difference]: Without dead ends: 86 [2022-11-23 15:01:56,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:01:56,077 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 47 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:01:56,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 128 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:01:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-23 15:01:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-11-23 15:01:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-23 15:01:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 113 transitions. [2022-11-23 15:01:56,147 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 113 transitions. Word has length 27 [2022-11-23 15:01:56,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:01:56,147 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 113 transitions. [2022-11-23 15:01:56,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:01:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 113 transitions. [2022-11-23 15:01:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 15:01:56,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:01:56,151 INFO L195 NwaCegarLoop]: trace histogram [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-23 15:01:56,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:01:56,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:01:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:01:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1853077635, now seen corresponding path program 1 times [2022-11-23 15:01:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:01:56,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270515892] [2022-11-23 15:01:56,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:01:56,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:01:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:01:56,283 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-23 15:01:56,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:01:56,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270515892] [2022-11-23 15:01:56,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270515892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:01:56,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:01:56,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:01:56,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396674949] [2022-11-23 15:01:56,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:01:56,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:01:56,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:01:56,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:01:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:01:56,288 INFO L87 Difference]: Start difference. First operand 82 states and 113 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:01:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:01:56,345 INFO L93 Difference]: Finished difference Result 238 states and 330 transitions. [2022-11-23 15:01:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:01:56,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-23 15:01:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:01:56,348 INFO L225 Difference]: With dead ends: 238 [2022-11-23 15:01:56,348 INFO L226 Difference]: Without dead ends: 157 [2022-11-23 15:01:56,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:01:56,350 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 48 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:01:56,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 114 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:01:56,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-23 15:01:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2022-11-23 15:01:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 128 states have (on average 1.390625) internal successors, (178), 129 states have internal predecessors, (178), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-23 15:01:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 208 transitions. [2022-11-23 15:01:56,373 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 208 transitions. Word has length 28 [2022-11-23 15:01:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:01:56,373 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 208 transitions. [2022-11-23 15:01:56,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:01:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 208 transitions. [2022-11-23 15:01:56,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-23 15:01:56,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:01:56,383 INFO L195 NwaCegarLoop]: trace histogram [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-23 15:01:56,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 15:01:56,384 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:01:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:01:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1269386223, now seen corresponding path program 1 times [2022-11-23 15:01:56,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:01:56,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378625808] [2022-11-23 15:01:56,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:01:56,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:01:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:01:56,471 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-23 15:01:56,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:01:56,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378625808] [2022-11-23 15:01:56,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378625808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:01:56,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:01:56,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:01:56,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639810775] [2022-11-23 15:01:56,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:01:56,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:01:56,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:01:56,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:01:56,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:01:56,474 INFO L87 Difference]: Start difference. First operand 153 states and 208 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:01:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:01:56,537 INFO L93 Difference]: Finished difference Result 393 states and 536 transitions. [2022-11-23 15:01:56,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:01:56,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-11-23 15:01:56,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:01:56,540 INFO L225 Difference]: With dead ends: 393 [2022-11-23 15:01:56,540 INFO L226 Difference]: Without dead ends: 241 [2022-11-23 15:01:56,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:01:56,543 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:01:56,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 113 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:01:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-23 15:01:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 227. [2022-11-23 15:01:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 194 states have internal predecessors, (263), 22 states have call successors, (22), 14 states have call predecessors, (22), 13 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-23 15:01:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 305 transitions. [2022-11-23 15:01:56,573 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 305 transitions. Word has length 29 [2022-11-23 15:01:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:01:56,573 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 305 transitions. [2022-11-23 15:01:56,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:01:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 305 transitions. [2022-11-23 15:01:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-23 15:01:56,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:01:56,577 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-11-23 15:01:56,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:01:56,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:01:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:01:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash -825438797, now seen corresponding path program 1 times [2022-11-23 15:01:56,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:01:56,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233963532] [2022-11-23 15:01:56,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:01:56,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:01:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:01:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:01:56,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:01:56,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233963532] [2022-11-23 15:01:56,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233963532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:01:56,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:01:56,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:01:56,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663771230] [2022-11-23 15:01:56,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:01:56,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:01:56,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:01:56,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:01:56,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:01:56,700 INFO L87 Difference]: Start difference. First operand 227 states and 305 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:01:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:01:56,772 INFO L93 Difference]: Finished difference Result 390 states and 523 transitions. [2022-11-23 15:01:56,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:01:56,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2022-11-23 15:01:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:01:56,776 INFO L225 Difference]: With dead ends: 390 [2022-11-23 15:01:56,776 INFO L226 Difference]: Without dead ends: 232 [2022-11-23 15:01:56,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:01:56,779 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 32 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:01:56,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 145 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:01:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-23 15:01:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 221. [2022-11-23 15:01:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 185 states have (on average 1.345945945945946) internal successors, (249), 188 states have internal predecessors, (249), 22 states have call successors, (22), 14 states have call predecessors, (22), 13 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-23 15:01:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 291 transitions. [2022-11-23 15:01:56,817 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 291 transitions. Word has length 42 [2022-11-23 15:01:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:01:56,818 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 291 transitions. [2022-11-23 15:01:56,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:01:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 291 transitions. [2022-11-23 15:01:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 15:01:56,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:01:56,820 INFO L195 NwaCegarLoop]: trace histogram [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-23 15:01:56,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 15:01:56,821 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:01:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:01:56,821 INFO L85 PathProgramCache]: Analyzing trace with hash -858400330, now seen corresponding path program 1 times [2022-11-23 15:01:56,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:01:56,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644426311] [2022-11-23 15:01:56,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:01:56,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:01:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:01:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 15:01:56,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:01:56,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644426311] [2022-11-23 15:01:56,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644426311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:01:56,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:01:56,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:01:56,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487547524] [2022-11-23 15:01:56,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:01:56,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:01:56,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:01:56,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:01:56,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:01:56,869 INFO L87 Difference]: Start difference. First operand 221 states and 291 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 15:01:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:01:56,932 INFO L93 Difference]: Finished difference Result 470 states and 615 transitions. [2022-11-23 15:01:56,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:01:56,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2022-11-23 15:01:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:01:56,952 INFO L225 Difference]: With dead ends: 470 [2022-11-23 15:01:56,952 INFO L226 Difference]: Without dead ends: 267 [2022-11-23 15:01:56,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:01:56,956 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 34 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:01:56,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 112 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:01:56,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-23 15:01:56,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2022-11-23 15:01:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 227 states have internal predecessors, (292), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-23 15:01:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 342 transitions. [2022-11-23 15:01:57,007 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 342 transitions. Word has length 45 [2022-11-23 15:01:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:01:57,008 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 342 transitions. [2022-11-23 15:01:57,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 15:01:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 342 transitions. [2022-11-23 15:01:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-23 15:01:57,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:01:57,010 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-11-23 15:01:57,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 15:01:57,010 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:01:57,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:01:57,011 INFO L85 PathProgramCache]: Analyzing trace with hash 617778564, now seen corresponding path program 1 times [2022-11-23 15:01:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:01:57,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283699206] [2022-11-23 15:01:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:01:57,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:01:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:01:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 15:01:57,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:01:57,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283699206] [2022-11-23 15:01:57,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283699206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:01:57,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:01:57,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:01:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869188144] [2022-11-23 15:01:57,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:01:57,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:01:57,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:01:57,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:01:57,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:01:57,154 INFO L87 Difference]: Start difference. First operand 267 states and 342 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:01:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:01:57,259 INFO L93 Difference]: Finished difference Result 307 states and 389 transitions. [2022-11-23 15:01:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:01:57,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 46 [2022-11-23 15:01:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:01:57,269 INFO L225 Difference]: With dead ends: 307 [2022-11-23 15:01:57,269 INFO L226 Difference]: Without dead ends: 304 [2022-11-23 15:01:57,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:01:57,275 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 114 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:01:57,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 110 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:01:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-23 15:01:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 266. [2022-11-23 15:01:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 226 states have internal predecessors, (290), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-23 15:01:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 339 transitions. [2022-11-23 15:01:57,312 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 339 transitions. Word has length 46 [2022-11-23 15:01:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:01:57,312 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 339 transitions. [2022-11-23 15:01:57,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:01:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 339 transitions. [2022-11-23 15:01:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-23 15:01:57,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:01:57,315 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-11-23 15:01:57,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 15:01:57,317 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:01:57,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:01:57,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1970942969, now seen corresponding path program 1 times [2022-11-23 15:01:57,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:01:57,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402293861] [2022-11-23 15:01:57,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:01:57,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:01:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:01:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 15:01:57,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:01:57,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402293861] [2022-11-23 15:01:57,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402293861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:01:57,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105583086] [2022-11-23 15:01:57,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:01:57,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:01:57,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:01:57,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:01:57,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 15:01:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:01:57,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 15:01:57,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:01:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:01:57,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:01:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 15:01:58,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105583086] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:01:58,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [814605728] [2022-11-23 15:01:58,139 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2022-11-23 15:01:58,139 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:01:58,144 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:01:58,151 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:01:58,152 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:01:59,843 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 66 for LOIs [2022-11-23 15:01:59,852 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 147 for LOIs [2022-11-23 15:02:00,680 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:02:08,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [814605728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:02:08,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:02:08,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [4, 4, 4] total 31 [2022-11-23 15:02:08,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586106492] [2022-11-23 15:02:08,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:02:08,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 15:02:08,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:08,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 15:02:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2022-11-23 15:02:08,005 INFO L87 Difference]: Start difference. First operand 266 states and 339 transitions. Second operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:02:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:11,751 INFO L93 Difference]: Finished difference Result 572 states and 729 transitions. [2022-11-23 15:02:11,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-23 15:02:11,752 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-11-23 15:02:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:11,755 INFO L225 Difference]: With dead ends: 572 [2022-11-23 15:02:11,755 INFO L226 Difference]: Without dead ends: 307 [2022-11-23 15:02:11,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 15:02:11,758 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 49 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:11,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 432 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 15:02:11,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-23 15:02:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 294. [2022-11-23 15:02:11,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 249 states have (on average 1.2690763052208835) internal successors, (316), 251 states have internal predecessors, (316), 26 states have call successors, (26), 19 states have call predecessors, (26), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-23 15:02:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 367 transitions. [2022-11-23 15:02:11,790 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 367 transitions. Word has length 47 [2022-11-23 15:02:11,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:11,790 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 367 transitions. [2022-11-23 15:02:11,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:02:11,791 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2022-11-23 15:02:11,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-23 15:02:11,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:11,792 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:11,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 15:02:11,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:11,999 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:11,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash -473088383, now seen corresponding path program 1 times [2022-11-23 15:02:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:11,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605503721] [2022-11-23 15:02:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:12,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:02:12,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:12,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605503721] [2022-11-23 15:02:12,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605503721] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:12,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327436825] [2022-11-23 15:02:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:12,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:12,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:12,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:02:12,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 15:02:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:12,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 15:02:12,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:02:12,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:02:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 15:02:12,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327436825] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:02:12,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1910938584] [2022-11-23 15:02:12,494 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2022-11-23 15:02:12,494 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:02:12,495 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:02:12,495 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:02:12,495 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:02:14,280 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 49 for LOIs [2022-11-23 15:02:14,288 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 147 for LOIs [2022-11-23 15:02:14,858 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:02:23,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1910938584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:02:23,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:02:23,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [5, 4, 4] total 36 [2022-11-23 15:02:23,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291863493] [2022-11-23 15:02:23,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:02:23,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-23 15:02:23,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:23,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-23 15:02:23,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 15:02:23,128 INFO L87 Difference]: Start difference. First operand 294 states and 367 transitions. Second operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:02:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:30,356 INFO L93 Difference]: Finished difference Result 548 states and 695 transitions. [2022-11-23 15:02:30,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-23 15:02:30,356 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2022-11-23 15:02:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:30,361 INFO L225 Difference]: With dead ends: 548 [2022-11-23 15:02:30,361 INFO L226 Difference]: Without dead ends: 320 [2022-11-23 15:02:30,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 131 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=287, Invalid=1969, Unknown=0, NotChecked=0, Total=2256 [2022-11-23 15:02:30,363 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 89 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:30,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 592 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-23 15:02:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-23 15:02:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 249. [2022-11-23 15:02:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 211 states have (on average 1.2654028436018958) internal successors, (267), 213 states have internal predecessors, (267), 22 states have call successors, (22), 16 states have call predecessors, (22), 15 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-23 15:02:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 310 transitions. [2022-11-23 15:02:30,406 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 310 transitions. Word has length 55 [2022-11-23 15:02:30,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:30,406 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 310 transitions. [2022-11-23 15:02:30,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:02:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 310 transitions. [2022-11-23 15:02:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-23 15:02:30,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:30,408 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:30,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 15:02:30,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:30,619 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash 627845419, now seen corresponding path program 1 times [2022-11-23 15:02:30,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:30,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142085893] [2022-11-23 15:02:30,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:30,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:02:30,777 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:30,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142085893] [2022-11-23 15:02:30,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142085893] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:30,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415350021] [2022-11-23 15:02:30,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:30,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:30,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:30,779 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:02:30,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 15:02:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:30,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 15:02:30,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:02:30,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:02:30,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415350021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:02:30,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:02:30,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 15:02:30,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700174044] [2022-11-23 15:02:30,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:02:30,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:02:30,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:30,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:02:30,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:02:30,882 INFO L87 Difference]: Start difference. First operand 249 states and 310 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 15:02:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:30,933 INFO L93 Difference]: Finished difference Result 425 states and 525 transitions. [2022-11-23 15:02:30,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:02:30,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 56 [2022-11-23 15:02:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:30,936 INFO L225 Difference]: With dead ends: 425 [2022-11-23 15:02:30,936 INFO L226 Difference]: Without dead ends: 181 [2022-11-23 15:02:30,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:02:30,940 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 27 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:30,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 124 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:02:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-23 15:02:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-11-23 15:02:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 153 states have (on average 1.2026143790849673) internal successors, (184), 154 states have internal predecessors, (184), 16 states have call successors, (16), 12 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-23 15:02:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 215 transitions. [2022-11-23 15:02:30,964 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 215 transitions. Word has length 56 [2022-11-23 15:02:30,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:30,964 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 215 transitions. [2022-11-23 15:02:30,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 15:02:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 215 transitions. [2022-11-23 15:02:30,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 15:02:30,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:30,965 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:30,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 15:02:31,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:31,172 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:31,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:31,173 INFO L85 PathProgramCache]: Analyzing trace with hash 523752351, now seen corresponding path program 1 times [2022-11-23 15:02:31,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:31,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689194979] [2022-11-23 15:02:31,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:31,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 15:02:31,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:31,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689194979] [2022-11-23 15:02:31,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689194979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:31,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406617247] [2022-11-23 15:02:31,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:31,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:31,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:31,244 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:02:31,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 15:02:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:31,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 15:02:31,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:02:31,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:02:31,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406617247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:02:31,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:02:31,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-11-23 15:02:31,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900674887] [2022-11-23 15:02:31,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:02:31,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:02:31,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:31,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:02:31,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:02:31,370 INFO L87 Difference]: Start difference. First operand 181 states and 215 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 15:02:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:31,422 INFO L93 Difference]: Finished difference Result 283 states and 346 transitions. [2022-11-23 15:02:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:02:31,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2022-11-23 15:02:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:31,426 INFO L225 Difference]: With dead ends: 283 [2022-11-23 15:02:31,426 INFO L226 Difference]: Without dead ends: 168 [2022-11-23 15:02:31,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:02:31,427 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 40 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:31,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 122 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:02:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-23 15:02:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2022-11-23 15:02:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.1714285714285715) internal successors, (164), 140 states have internal predecessors, (164), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-23 15:02:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 193 transitions. [2022-11-23 15:02:31,464 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 193 transitions. Word has length 60 [2022-11-23 15:02:31,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:31,464 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 193 transitions. [2022-11-23 15:02:31,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 15:02:31,465 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 193 transitions. [2022-11-23 15:02:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 15:02:31,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:31,466 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:31,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 15:02:31,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:31,680 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:31,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:31,680 INFO L85 PathProgramCache]: Analyzing trace with hash 96621917, now seen corresponding path program 1 times [2022-11-23 15:02:31,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:31,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838563250] [2022-11-23 15:02:31,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:31,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 15:02:31,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:31,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838563250] [2022-11-23 15:02:31,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838563250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:02:31,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:02:31,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:02:31,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825451340] [2022-11-23 15:02:31,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:02:31,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:02:31,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:31,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:02:31,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:02:31,729 INFO L87 Difference]: Start difference. First operand 166 states and 193 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 15:02:31,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:31,792 INFO L93 Difference]: Finished difference Result 264 states and 315 transitions. [2022-11-23 15:02:31,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:02:31,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2022-11-23 15:02:31,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:31,794 INFO L225 Difference]: With dead ends: 264 [2022-11-23 15:02:31,794 INFO L226 Difference]: Without dead ends: 164 [2022-11-23 15:02:31,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:02:31,795 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 61 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:31,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 115 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:02:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-23 15:02:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-11-23 15:02:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.1521739130434783) internal successors, (159), 138 states have internal predecessors, (159), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-23 15:02:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 188 transitions. [2022-11-23 15:02:31,819 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 188 transitions. Word has length 60 [2022-11-23 15:02:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:31,820 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 188 transitions. [2022-11-23 15:02:31,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-23 15:02:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 188 transitions. [2022-11-23 15:02:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-23 15:02:31,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:31,822 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:31,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 15:02:31,822 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:31,823 INFO L85 PathProgramCache]: Analyzing trace with hash 88585954, now seen corresponding path program 1 times [2022-11-23 15:02:31,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:31,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396533348] [2022-11-23 15:02:31,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:31,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-23 15:02:31,962 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:31,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396533348] [2022-11-23 15:02:31,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396533348] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:31,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004417773] [2022-11-23 15:02:31,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:31,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:31,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:31,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:02:31,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 15:02:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:32,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 15:02:32,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 15:02:32,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:02:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-23 15:02:32,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004417773] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:02:32,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [270517481] [2022-11-23 15:02:32,424 INFO L159 IcfgInterpreter]: Started Sifa with 42 locations of interest [2022-11-23 15:02:32,424 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:02:32,425 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:02:32,425 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:02:32,425 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:02:36,572 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 55 for LOIs [2022-11-23 15:02:36,579 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 75 for LOIs [2022-11-23 15:02:36,592 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 45 for LOIs [2022-11-23 15:02:36,699 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:02:43,985 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10527#(and (<= 0 ~p_dw_pc~0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 1) (= ~c_num_read~0 1) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~q_write_ev~0 2) (= ~c_last_read~0 ~q_buf_0~0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 15:02:43,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:02:43,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:02:43,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-23 15:02:43,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404462695] [2022-11-23 15:02:43,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:02:43,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:02:43,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:43,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:02:43,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1567, Unknown=0, NotChecked=0, Total=1722 [2022-11-23 15:02:43,988 INFO L87 Difference]: Start difference. First operand 164 states and 188 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-23 15:02:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:44,165 INFO L93 Difference]: Finished difference Result 347 states and 398 transitions. [2022-11-23 15:02:44,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:02:44,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 61 [2022-11-23 15:02:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:44,168 INFO L225 Difference]: With dead ends: 347 [2022-11-23 15:02:44,168 INFO L226 Difference]: Without dead ends: 344 [2022-11-23 15:02:44,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 142 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=155, Invalid=1567, Unknown=0, NotChecked=0, Total=1722 [2022-11-23 15:02:44,169 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 152 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:44,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 387 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:02:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-11-23 15:02:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 220. [2022-11-23 15:02:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 185 states have (on average 1.162162162162162) internal successors, (215), 186 states have internal predecessors, (215), 20 states have call successors, (20), 15 states have call predecessors, (20), 14 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-23 15:02:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 254 transitions. [2022-11-23 15:02:44,199 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 254 transitions. Word has length 61 [2022-11-23 15:02:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:44,200 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 254 transitions. [2022-11-23 15:02:44,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-23 15:02:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 254 transitions. [2022-11-23 15:02:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-23 15:02:44,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:44,201 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:44,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 15:02:44,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 15:02:44,406 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:44,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:44,406 INFO L85 PathProgramCache]: Analyzing trace with hash -807361363, now seen corresponding path program 2 times [2022-11-23 15:02:44,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:44,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629780765] [2022-11-23 15:02:44,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:44,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-23 15:02:44,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:44,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629780765] [2022-11-23 15:02:44,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629780765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:02:44,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:02:44,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:02:44,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47164129] [2022-11-23 15:02:44,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:02:44,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:02:44,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:44,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:02:44,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:02:44,456 INFO L87 Difference]: Start difference. First operand 220 states and 254 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 15:02:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:44,503 INFO L93 Difference]: Finished difference Result 344 states and 397 transitions. [2022-11-23 15:02:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:02:44,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 74 [2022-11-23 15:02:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:44,505 INFO L225 Difference]: With dead ends: 344 [2022-11-23 15:02:44,505 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 15:02:44,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:02:44,506 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:44,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 112 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:02:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 15:02:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 15:02:44,508 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-23 15:02:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 15:02:44,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-11-23 15:02:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:44,509 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 15:02:44,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 15:02:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 15:02:44,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 15:02:44,512 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 15:02:44,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 15:02:44,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 15:02:52,936 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 67) no Hoare annotation was computed. [2022-11-23 15:02:52,944 INFO L895 garLoopResultBuilder]: At program point immediate_notify_threadsENTRY(lines 76 100) the Hoare annotation is: (let ((.cse23 (select |#memory_int| 1))) (let ((.cse0 (not (= ~a_t~0 0))) (.cse1 (not (= (select .cse23 0) 48))) (.cse2 (not (= |#NULL.offset| 0))) (.cse3 (not (= ~p_num_write~0 1))) (.cse4 (not (= 2 (select |#length| 1)))) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse6 (not (< 0 |#StackHeapBarrier|))) (.cse7 (not (= (select |#valid| 3) 1))) (.cse8 (not (<= 0 (+ ~q_buf_0~0 2147483648)))) (.cse9 (not (= (select |#length| 3) 12))) (.cse10 (not (= (select |#valid| 0) 0))) (.cse11 (not (= (select .cse23 1) 0))) (.cse12 (not (= (select |#valid| 1) 1))) (.cse13 (not (= 19 (select |#length| 2)))) (.cse15 (not (= |#NULL.base| 0))) (.cse17 (not (= ~p_dw_i~0 1))) (.cse18 (not (= (select |#valid| 2) 1))) (.cse20 (not (<= ~p_last_write~0 2147483647))) (.cse22 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse16 (not (= ~q_write_ev~0 2))) (.cse19 (not (= ~q_free~0 1))) (.cse14 (<= 2 ~p_dw_st~0)) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 (not (= ~q_read_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= |old(~p_dw_st~0)| 2)) .cse11 (not (= ~p_dw_pc~0 1)) .cse12 .cse13 (and (<= ~p_dw_st~0 2) (<= 1 ~c_dr_st~0) (<= ~c_dr_st~0 1) .cse14) (not (= ~c_num_read~0 1)) .cse15 (not (= ~c_last_read~0 ~q_buf_0~0)) .cse16 .cse17 (not (<= 1 |old(~c_dr_st~0)|)) .cse18 .cse19 .cse20 .cse21 (not (<= |old(~c_dr_st~0)| 1)) (not (= 1 ~c_dr_i~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 1 ~c_dr_i~0)) .cse8 (not (= ~p_dw_pc~0 0)) .cse9 .cse22 .cse10 .cse11 (not (<= ~c_last_read~0 0)) .cse12 .cse13 (not (<= ~q_free~0 0)) .cse15 (not (<= ~c_dr_i~0 1)) (not (<= ~c_num_read~0 0)) (not (<= 0 ~c_num_read~0)) (not (= |old(~p_dw_st~0)| 1)) (not (= ~q_write_ev~0 1)) .cse17 .cse18 (and (<= ~c_dr_st~0 0) (<= 1 ~p_dw_st~0) (<= 0 ~c_dr_st~0) (<= ~p_dw_st~0 1)) (not (<= 0 ~q_free~0)) .cse20 (not (<= 0 ~c_last_read~0)) (not (= ~q_read_ev~0 2)) (not (<= |old(~c_dr_st~0)| 0)) (not (<= 0 |old(~c_dr_st~0)|))) (or (not (<= 2 |old(~p_dw_st~0)|)) (not (<= ~c_num_read~0 ~p_num_write~0)) .cse22 (not (<= ~p_num_write~0 ~c_num_read~0)) (not (= ~c_dr_pc~0 1)) .cse16 .cse19 .cse14 .cse21)))) [2022-11-23 15:02:52,952 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 51) no Hoare annotation was computed. [2022-11-23 15:02:52,952 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 76 100) no Hoare annotation was computed. [2022-11-23 15:02:52,953 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 42 51) no Hoare annotation was computed. [2022-11-23 15:02:52,953 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 70) no Hoare annotation was computed. [2022-11-23 15:02:52,953 INFO L899 garLoopResultBuilder]: For program point L61-2(lines 61 70) no Hoare annotation was computed. [2022-11-23 15:02:52,954 INFO L895 garLoopResultBuilder]: At program point L53(lines 41 55) the Hoare annotation is: (let ((.cse23 (select |#memory_int| 1))) (let ((.cse0 (not (= ~a_t~0 0))) (.cse1 (not (= (select .cse23 0) 48))) (.cse2 (not (= |#NULL.offset| 0))) (.cse3 (not (= ~p_num_write~0 1))) (.cse4 (not (= 2 (select |#length| 1)))) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse6 (not (< 0 |#StackHeapBarrier|))) (.cse7 (not (= (select |#valid| 3) 1))) (.cse8 (not (<= 0 (+ ~q_buf_0~0 2147483648)))) (.cse9 (not (= (select |#length| 3) 12))) (.cse11 (not (= (select |#valid| 0) 0))) (.cse12 (not (= (select .cse23 1) 0))) (.cse13 (not (= (select |#valid| 1) 1))) (.cse14 (not (= 19 (select |#length| 2)))) (.cse15 (not (= |#NULL.base| 0))) (.cse16 (not (= ~p_dw_i~0 1))) (.cse17 (not (= (select |#valid| 2) 1))) (.cse18 (not (<= ~p_last_write~0 2147483647))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse19 (not (= ~q_write_ev~0 2))) (.cse20 (not (= ~q_free~0 1))) (.cse22 (<= 2 ~p_dw_st~0)) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 1 ~c_dr_i~0)) .cse8 (not (= ~p_dw_pc~0 0)) .cse9 .cse10 .cse11 .cse12 (not (<= ~c_last_read~0 0)) .cse13 .cse14 (and (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 1 ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (<= ~p_dw_st~0 1)) (not (<= ~q_free~0 0)) .cse15 (not (<= ~c_dr_i~0 1)) (not (<= ~c_num_read~0 0)) (not (<= 0 ~c_num_read~0)) (not (= |old(~p_dw_st~0)| 1)) (not (= ~q_write_ev~0 1)) .cse16 .cse17 (not (<= 0 ~q_free~0)) .cse18 (not (<= 0 ~c_last_read~0)) (not (= ~q_read_ev~0 2)) (not (<= |old(~c_dr_st~0)| 0)) (not (<= 0 |old(~c_dr_st~0)|))) (or .cse0 (not (= ~q_read_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 (not (= |old(~p_dw_st~0)| 2)) .cse12 (not (= ~p_dw_pc~0 1)) .cse13 .cse14 (not (= ~c_num_read~0 1)) .cse15 (not (= ~c_last_read~0 ~q_buf_0~0)) .cse19 .cse16 (not (<= 1 |old(~c_dr_st~0)|)) .cse17 .cse20 .cse18 .cse21 (and (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 1) (<= ~p_dw_st~0 2) (<= 1 ~c_dr_st~0) (<= ~c_dr_st~0 1) .cse22) (not (<= |old(~c_dr_st~0)| 1)) (not (= 1 ~c_dr_i~0))) (or (not (<= 2 |old(~p_dw_st~0)|)) (not (<= ~c_num_read~0 ~p_num_write~0)) .cse10 (not (<= ~p_num_write~0 ~c_num_read~0)) (not (= ~c_dr_pc~0 1)) .cse19 .cse20 .cse22 .cse21)))) [2022-11-23 15:02:52,957 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 48) no Hoare annotation was computed. [2022-11-23 15:02:52,958 INFO L895 garLoopResultBuilder]: At program point L72(lines 60 74) the Hoare annotation is: (let ((.cse21 (select |#memory_int| 1))) (let ((.cse0 (not (= ~a_t~0 0))) (.cse1 (not (= (select .cse21 0) 48))) (.cse2 (not (= |#NULL.offset| 0))) (.cse3 (not (= ~p_num_write~0 1))) (.cse4 (not (= 2 (select |#length| 1)))) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse6 (not (< 0 |#StackHeapBarrier|))) (.cse7 (not (= (select |#valid| 3) 1))) (.cse8 (not (<= 0 (+ ~q_buf_0~0 2147483648)))) (.cse9 (not (= (select |#length| 3) 12))) (.cse10 (not (= (select |#valid| 0) 0))) (.cse11 (not (= (select .cse21 1) 0))) (.cse12 (not (= (select |#valid| 1) 1))) (.cse13 (not (= 19 (select |#length| 2)))) (.cse14 (not (= |#NULL.base| 0))) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (not (= (select |#valid| 2) 1))) (.cse17 (not (<= ~p_last_write~0 2147483647))) (.cse18 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse19 (= |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1| 0)) (.cse20 (= |immediate_notify_threads_is_do_write_p_triggered_#res#1| |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))) (and (or .cse0 (not (= ~q_read_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= |old(~p_dw_st~0)| 2)) .cse11 (not (= ~p_dw_pc~0 1)) .cse12 .cse13 (not (= ~c_num_read~0 1)) .cse14 (not (= ~c_last_read~0 ~q_buf_0~0)) (not (= ~q_write_ev~0 2)) .cse15 (not (<= 1 |old(~c_dr_st~0)|)) .cse16 (not (= ~q_free~0 1)) .cse17 (and (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 1) (= |immediate_notify_threads_~tmp~0#1| |immediate_notify_threads_is_do_write_p_triggered_#res#1|) .cse18 .cse19 .cse20 (= ~p_dw_st~0 0)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (<= |old(~c_dr_st~0)| 1)) (not (= 1 ~c_dr_i~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 1 ~c_dr_i~0)) .cse8 (not (= ~p_dw_pc~0 0)) .cse9 (not (= ~p_last_write~0 ~q_buf_0~0)) .cse10 .cse11 (not (<= ~c_last_read~0 0)) .cse12 .cse13 (not (<= ~q_free~0 0)) .cse14 (not (<= ~c_dr_i~0 1)) (not (<= ~c_num_read~0 0)) (not (<= 0 ~c_num_read~0)) (not (= |old(~p_dw_st~0)| 1)) (not (= ~q_write_ev~0 1)) .cse15 .cse16 (not (<= 0 ~q_free~0)) .cse17 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (= |immediate_notify_threads_~tmp~0#1| 0) .cse18 .cse19 .cse20) (not (<= 0 ~c_last_read~0)) (not (= ~q_read_ev~0 2)) (not (<= |old(~c_dr_st~0)| 0)) (not (<= 0 |old(~c_dr_st~0)|)))))) [2022-11-23 15:02:52,959 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 220 239) no Hoare annotation was computed. [2022-11-23 15:02:52,959 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 220 239) the Hoare annotation is: true [2022-11-23 15:02:52,959 INFO L895 garLoopResultBuilder]: At program point L192(line 192) the Hoare annotation is: false [2022-11-23 15:02:52,959 INFO L895 garLoopResultBuilder]: At program point L192-1(lines 148 200) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_write_ev~0 2))) (or (and .cse0 (<= ~c_num_read~0 ~p_num_write~0) (= ~q_free~0 1) (<= ~p_num_write~0 ~c_num_read~0) .cse1 (= ~c_last_read~0 ~p_last_write~0)) (let ((.cse2 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= ~c_num_read~0 0) (not (= |ULTIMATE.start_eval_~tmp___0~1#1| 0)) .cse0 (<= |ULTIMATE.start_eval_~tmp~1#1| 2147483647) (<= 0 (+ |ULTIMATE.start_eval_~tmp___0~1#1| 2147483648)) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= ~q_free~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (<= |ULTIMATE.start_eval_~tmp___0~1#1| 2147483647) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~p_dw_pc~0 1) .cse1 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~q_read_ev~0 2) (<= 0 (+ |ULTIMATE.start_eval_~tmp~1#1| 2147483648)) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval_~tmp~1#1| 0)) (= 2 ~p_dw_st~0) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= ~p_num_write~0 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (= ~a_t~0 0) (= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (= (select .cse2 0) 48) (= (select .cse2 1) 0) (= ~c_dr_st~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))))) [2022-11-23 15:02:52,960 INFO L899 garLoopResultBuilder]: For program point L250(line 250) no Hoare annotation was computed. [2022-11-23 15:02:52,960 INFO L899 garLoopResultBuilder]: For program point L118(lines 117 137) no Hoare annotation was computed. [2022-11-23 15:02:52,960 INFO L895 garLoopResultBuilder]: At program point L300(line 300) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~q_free~0 1)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse4 (= ~q_write_ev~0 2)) (.cse3 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 ~q_free~0) (= ~c_num_read~0 0) (<= ~p_dw_pc~0 1) .cse1 (<= 0 ~p_dw_pc~0) (= ~c_last_read~0 0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= ~p_num_write~0 1) (<= ~q_read_ev~0 2) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse4 (<= ~q_free~0 1) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (<= 2 ~q_read_ev~0) (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) (= ~a_t~0 0) .cse3 (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse5 .cse4) (let ((.cse6 (+ ~c_num_read~0 1))) (and .cse1 (= ~q_free~0 0) .cse5 .cse4 (<= .cse6 ~p_num_write~0) .cse3 (<= ~p_num_write~0 .cse6))))) [2022-11-23 15:02:52,970 INFO L895 garLoopResultBuilder]: At program point L300-1(line 300) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~q_free~0 1)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse4 (= ~q_write_ev~0 2)) (.cse3 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 ~q_free~0) (= ~c_num_read~0 0) (<= ~p_dw_pc~0 1) .cse1 (<= 0 ~p_dw_pc~0) (= ~c_last_read~0 0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= ~p_num_write~0 1) (<= ~q_read_ev~0 2) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse4 (<= ~q_free~0 1) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (<= 2 ~q_read_ev~0) (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) (= ~a_t~0 0) .cse3 (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse5 .cse4) (let ((.cse6 (+ ~c_num_read~0 1))) (and .cse1 (= ~q_free~0 0) .cse5 .cse4 (<= .cse6 ~p_num_write~0) .cse3 (<= ~p_num_write~0 .cse6))))) [2022-11-23 15:02:52,970 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-23 15:02:52,971 INFO L895 garLoopResultBuilder]: At program point L152(lines 152 156) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 0) (= ~c_dr_pc~0 1) (= ~q_write_ev~0 2) (<= .cse0 ~p_num_write~0) (<= 2 ~p_dw_st~0) (<= ~p_num_write~0 .cse0))) [2022-11-23 15:02:52,971 INFO L895 garLoopResultBuilder]: At program point L119(lines 105 142) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_write_ev~0 2))) (or (let ((.cse2 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) .cse0 (<= |ULTIMATE.start_eval_~tmp~1#1| 2147483647) (= ~p_last_write~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (<= ~q_read_ev~0 2) .cse1 (= ~p_dw_st~0 1) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (<= 0 (+ |ULTIMATE.start_eval_~tmp~1#1| 2147483648)) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval_~tmp~1#1| 0)) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (<= 2 ~q_read_ev~0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~a_t~0 0) (= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (= (select .cse2 0) 48) (= (select .cse2 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) (and .cse0 (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (= ~c_dr_pc~0 1) .cse1))) [2022-11-23 15:02:52,971 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 283) no Hoare annotation was computed. [2022-11-23 15:02:52,971 INFO L899 garLoopResultBuilder]: For program point L161(lines 160 195) no Hoare annotation was computed. [2022-11-23 15:02:52,972 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2022-11-23 15:02:52,972 INFO L899 garLoopResultBuilder]: For program point L252-1(lines 247 287) no Hoare annotation was computed. [2022-11-23 15:02:52,972 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 268) no Hoare annotation was computed. [2022-11-23 15:02:52,972 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 162 172) no Hoare annotation was computed. [2022-11-23 15:02:52,972 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: false [2022-11-23 15:02:52,973 INFO L895 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 1)) (.cse2 (= ~q_write_ev~0 2)) (.cse3 (= ~c_last_read~0 ~p_last_write~0))) (or (let ((.cse4 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (not (= |ULTIMATE.start_eval_~tmp___0~1#1| 0)) .cse0 (<= |ULTIMATE.start_eval_~tmp~1#1| 2147483647) (= |ULTIMATE.start_do_read_c_~a~0#1| ~q_buf_0~0) (<= 0 (+ |ULTIMATE.start_eval_~tmp___0~1#1| 2147483648)) .cse1 (= ~q_read_ev~0 1) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~c_num_read~0 1) (<= |ULTIMATE.start_eval_~tmp___0~1#1| 2147483647) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~p_dw_pc~0 1) .cse2 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (<= 0 (+ |ULTIMATE.start_eval_~tmp~1#1| 2147483648)) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval_~tmp~1#1| 0)) (= 2 ~p_dw_st~0) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= ~p_num_write~0 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) .cse3 (<= ~p_last_write~0 2147483647) (= ~a_t~0 0) (= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (= (select .cse4 0) 48) (= (select .cse4 1) 0) (= ~c_dr_st~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) (and .cse0 (<= ~c_num_read~0 ~p_num_write~0) .cse1 (<= ~p_num_write~0 ~c_num_read~0) (= ~c_dr_pc~0 1) .cse2 .cse3 (<= 2 ~p_dw_st~0)))) [2022-11-23 15:02:52,973 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2022-11-23 15:02:52,973 INFO L902 garLoopResultBuilder]: At program point L336(lines 313 341) the Hoare annotation is: true [2022-11-23 15:02:52,973 INFO L895 garLoopResultBuilder]: At program point L138(lines 101 143) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 0)) (.cse2 (= ~q_write_ev~0 2))) (or (let ((.cse3 (+ ~c_num_read~0 1))) (and .cse0 .cse1 (= ~c_dr_pc~0 1) .cse2 (<= .cse3 ~p_num_write~0) (<= 2 ~p_dw_st~0) (<= ~p_num_write~0 .cse3))) (let ((.cse4 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= ~c_num_read~0 0) .cse0 (<= |ULTIMATE.start_eval_~tmp~1#1| 2147483647) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) .cse1 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~p_dw_pc~0 1) .cse2 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~q_read_ev~0 2) (<= 0 (+ |ULTIMATE.start_eval_~tmp~1#1| 2147483648)) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval_~tmp~1#1| 0)) (= 2 ~p_dw_st~0) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= ~p_num_write~0 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (= ~a_t~0 0) (= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (= (select .cse4 0) 48) (= (select .cse4 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))))) [2022-11-23 15:02:52,974 INFO L895 garLoopResultBuilder]: At program point L196(lines 145 201) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 1))) (or (and .cse0 .cse1 .cse2 (<= 2 ~p_dw_st~0)) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) (= ~c_dr_pc~0 1) (= ~q_write_ev~0 2)))) [2022-11-23 15:02:52,974 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 114) no Hoare annotation was computed. [2022-11-23 15:02:52,974 INFO L895 garLoopResultBuilder]: At program point L288(lines 240 293) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~q_free~0 1)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse4 (= ~q_write_ev~0 2)) (.cse3 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 ~q_free~0) (= ~c_num_read~0 0) (<= ~p_dw_pc~0 1) .cse1 (<= 0 ~p_dw_pc~0) (= ~c_last_read~0 0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= ~p_num_write~0 1) (<= ~q_read_ev~0 2) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse4 (<= ~q_free~0 1) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (<= 2 ~q_read_ev~0) (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) (= ~a_t~0 0) .cse3 (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse5 .cse4) (let ((.cse6 (+ ~c_num_read~0 1))) (and .cse1 (= ~q_free~0 0) .cse5 .cse4 (<= .cse6 ~p_num_write~0) .cse3 (<= ~p_num_write~0 .cse6))))) [2022-11-23 15:02:52,975 INFO L895 garLoopResultBuilder]: At program point L272(lines 247 287) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~q_free~0 1)) (.cse4 (<= 0 ~p_dw_pc~0)) (.cse5 (<= 0 ~p_num_write~0)) (.cse6 (<= ~q_read_ev~0 2)) (.cse7 (<= ~q_free~0 1)) (.cse8 (<= 2 ~q_read_ev~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~q_write_ev~0 2)) (.cse3 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse9 (select |#memory_int| 1))) (and (<= ~p_last_write~0 0) (<= 1 ~p_dw_i~0) (<= 1 ~q_free~0) (<= 1 |ULTIMATE.start_start_simulation_~kernel_st~0#1|) (= (select |#length| 3) 12) (<= ~p_num_write~0 0) (<= ~c_dr_st~0 0) (<= 0 ~q_buf_0~0) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= 1 ~c_dr_i~0) (<= 0 ~c_dr_pc~0) (<= ~c_num_read~0 0) (<= ~c_last_read~0 0) (<= 0 ~p_last_write~0) (<= ~p_dw_pc~0 0) (<= ~c_dr_i~0 1) .cse4 .cse5 (<= ~a_t~0 0) (<= 2 ~q_write_ev~0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (<= |#NULL.offset| 0) (<= ~p_dw_i~0 1) (<= 0 ~c_dr_st~0) .cse6 .cse7 (<= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (<= 0 ~a_t~0) (<= |#NULL.base| 0) (= (select |#valid| 0) 0) .cse8 (= (select |#valid| 2) 1) (<= ~c_dr_pc~0 0) (= (select .cse9 0) 48) (<= 0 |#NULL.offset|) (= (select .cse9 1) 0) (<= 0 ~c_num_read~0) (<= ~q_buf_0~0 0) (<= 0 ~c_last_read~0) (< 0 |#StackHeapBarrier|))) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11) (and (<= 0 ~q_free~0) (= ~c_num_read~0 0) (<= ~p_dw_pc~0 1) .cse1 .cse4 (= ~c_last_read~0 0) .cse5 (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= ~p_num_write~0 1) .cse6 (<= 0 (+ ~q_buf_0~0 2147483648)) .cse11 .cse7 (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) .cse8 (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (= ~a_t~0 0) .cse3 (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) (let ((.cse12 (+ ~c_num_read~0 1))) (and .cse1 (= ~q_free~0 0) .cse10 .cse11 (<= .cse12 ~p_num_write~0) .cse3 (<= ~p_num_write~0 .cse12))))) [2022-11-23 15:02:52,975 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2022-11-23 15:02:52,975 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 15:02:52,976 INFO L895 garLoopResultBuilder]: At program point L248(line 248) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~q_free~0 1)) (.cse4 (<= 0 ~p_dw_pc~0)) (.cse5 (<= 0 ~p_num_write~0)) (.cse6 (<= ~q_read_ev~0 2)) (.cse7 (<= ~q_free~0 1)) (.cse8 (<= 2 ~q_read_ev~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~q_write_ev~0 2)) (.cse3 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse9 (select |#memory_int| 1))) (and (<= ~p_last_write~0 0) (<= 1 ~p_dw_i~0) (<= 1 ~q_free~0) (<= 1 |ULTIMATE.start_start_simulation_~kernel_st~0#1|) (= (select |#length| 3) 12) (<= ~p_num_write~0 0) (<= ~c_dr_st~0 0) (<= 0 ~q_buf_0~0) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= 1 ~c_dr_i~0) (<= 0 ~c_dr_pc~0) (<= ~c_num_read~0 0) (<= ~c_last_read~0 0) (<= 0 ~p_last_write~0) (<= ~p_dw_pc~0 0) (<= ~c_dr_i~0 1) .cse4 .cse5 (<= ~a_t~0 0) (<= 2 ~q_write_ev~0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (<= |#NULL.offset| 0) (<= ~p_dw_i~0 1) (<= 0 ~c_dr_st~0) .cse6 .cse7 (<= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (<= 0 ~a_t~0) (<= |#NULL.base| 0) (= (select |#valid| 0) 0) .cse8 (= (select |#valid| 2) 1) (<= ~c_dr_pc~0 0) (= (select .cse9 0) 48) (<= 0 |#NULL.offset|) (= (select .cse9 1) 0) (<= 0 ~c_num_read~0) (<= ~q_buf_0~0 0) (<= 0 ~c_last_read~0) (< 0 |#StackHeapBarrier|))) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11) (and (<= 0 ~q_free~0) (= ~c_num_read~0 0) (<= ~p_dw_pc~0 1) .cse1 .cse4 (= ~c_last_read~0 0) .cse5 (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= ~p_num_write~0 1) .cse6 (<= 0 (+ ~q_buf_0~0 2147483648)) .cse11 .cse7 (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) .cse8 (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (= ~a_t~0 0) .cse3 (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) (let ((.cse12 (+ ~c_num_read~0 1))) (and .cse1 (= ~q_free~0 0) .cse10 .cse11 (<= .cse12 ~p_num_write~0) .cse3 (<= ~p_num_write~0 .cse12))))) [2022-11-23 15:02:52,976 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 194) no Hoare annotation was computed. [2022-11-23 15:02:52,976 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2022-11-23 15:02:52,976 INFO L899 garLoopResultBuilder]: For program point L257(lines 247 287) no Hoare annotation was computed. [2022-11-23 15:02:52,977 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 335) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse13 (= ~c_dr_pc~0 1)) (.cse3 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 1)) (.cse5 (= ~c_last_read~0 0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_write_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (= |#NULL.offset| 0)) (.cse11 (= ~a_t~0 0)) (.cse12 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 ~q_free~0) .cse4 (<= ~p_dw_pc~0 1) .cse1 (<= 0 ~p_dw_pc~0) .cse5 (<= 0 ~p_num_write~0) .cse6 (<= ~p_dw_st~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= ~p_num_write~0 1) (<= ~q_read_ev~0 2) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse7 (<= ~q_free~0 1) .cse8 .cse9 (<= 2 ~q_read_ev~0) .cse10 (<= ~p_last_write~0 2147483647) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) .cse11 .cse3 (<= 0 |#StackHeapBarrier|) .cse12) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse13 .cse7) (let ((.cse14 (+ ~c_num_read~0 1))) (and .cse1 (= ~q_free~0 0) .cse13 .cse7 (<= .cse14 ~p_num_write~0) .cse3 (<= ~p_num_write~0 .cse14))) (let ((.cse15 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) .cse4 .cse1 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~q_write_ev~0 ~q_read_ev~0) .cse2 .cse5 .cse6 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse7 (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) .cse8 .cse9 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) .cse10 (= ~c_last_read~0 ~p_last_write~0) .cse11 (= (select .cse15 0) 48) (= (select .cse15 1) 0) (< 0 |#StackHeapBarrier|) .cse12)))) [2022-11-23 15:02:52,977 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 189) no Hoare annotation was computed. [2022-11-23 15:02:52,977 INFO L895 garLoopResultBuilder]: At program point L117-1(lines 105 142) the Hoare annotation is: (let ((.cse30 (select |#memory_int| 1))) (let ((.cse5 (= ~q_free~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= (select |#length| 3) 12)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= |ULTIMATE.start_eval_~tmp~1#1| 2147483647)) (.cse6 (= ~c_last_read~0 0)) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse9 (= 2 (select |#length| 1))) (.cse10 (= (select |#valid| 3) 1)) (.cse12 (= (select |#valid| 1) 1)) (.cse13 (= 19 (select |#length| 2))) (.cse14 (<= 0 (+ |ULTIMATE.start_eval_~tmp~1#1| 2147483648))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (not (= |ULTIMATE.start_eval_~tmp~1#1| 0))) (.cse17 (= ~p_dw_i~0 1)) (.cse18 (= (select |#valid| 0) 0)) (.cse19 (= (select |#valid| 2) 1)) (.cse20 (= |#NULL.offset| 0)) (.cse21 (= ~a_t~0 0)) (.cse22 (= |ULTIMATE.start_eval_~tmp___1~0#1| 1)) (.cse23 (= (select .cse30 0) 48)) (.cse24 (= (select .cse30 1) 0)) (.cse25 (< 0 |#StackHeapBarrier|)) (.cse26 (= |#NULL.base| 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= ~q_free~0 0)) (.cse27 (= ~c_dr_pc~0 1)) (.cse11 (= ~q_write_ev~0 2))) (or (and .cse0 (= ~c_dr_st~0 0) (= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~q_read_ev~0 2) .cse11 (= ~p_dw_st~0 1) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 2 ~q_read_ev~0) .cse19 .cse20 (= ~c_last_read~0 ~p_last_write~0) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and (= ~c_dr_st~0 2) .cse3 (<= ~c_num_read~0 ~p_num_write~0) .cse5 (<= ~p_num_write~0 ~c_num_read~0) .cse27 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ~p_dw_st~0) .cse6 .cse7 (<= ~p_dw_st~0 2) .cse8 .cse28 .cse9 .cse10 (<= 0 (+ ~q_buf_0~0 2147483648)) .cse11 .cse12 .cse13 (= ~q_read_ev~0 2) .cse14 .cse15 .cse16 .cse17 .cse18 (= ~p_num_write~0 1) .cse19 .cse20 (<= ~p_last_write~0 2147483647) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse29 (+ ~c_num_read~0 1))) (and .cse3 .cse28 .cse27 .cse11 (<= .cse29 ~p_num_write~0) (<= ~p_num_write~0 .cse29)))))) [2022-11-23 15:02:52,978 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 113) no Hoare annotation was computed. [2022-11-23 15:02:52,978 INFO L895 garLoopResultBuilder]: At program point L134(line 134) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 0)) (.cse3 (= ~q_write_ev~0 1))) (or (let ((.cse2 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (<= ~q_buf_0~0 2147483647) .cse0 (<= |ULTIMATE.start_eval_~tmp~1#1| 2147483647) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) .cse1 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~p_dw_st~0 1) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~q_read_ev~0 2) (<= 0 (+ |ULTIMATE.start_eval_~tmp~1#1| 2147483648)) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval_~tmp~1#1| 0)) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= ~p_num_write~0 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~a_t~0 0) (= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (= (select .cse2 0) 48) (= (select .cse2 1) 0) .cse3 (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) (let ((.cse4 (+ ~c_num_read~0 1))) (and .cse0 .cse1 (= ~c_dr_pc~0 1) (<= .cse4 ~p_num_write~0) (<= ~p_num_write~0 .cse4) .cse3)))) [2022-11-23 15:02:52,978 INFO L899 garLoopResultBuilder]: For program point L134-1(line 134) no Hoare annotation was computed. [2022-11-23 15:02:52,978 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-11-23 15:02:52,979 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-11-23 15:02:52,979 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2022-11-23 15:02:52,982 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:52,996 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:02:53,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:02:53 BoogieIcfgContainer [2022-11-23 15:02:53,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:02:53,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:02:53,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:02:53,076 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:02:53,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:01:55" (3/4) ... [2022-11-23 15:02:53,079 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 15:02:53,085 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2022-11-23 15:02:53,085 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-23 15:02:53,085 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-23 15:02:53,095 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-11-23 15:02:53,095 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-23 15:02:53,096 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-23 15:02:53,096 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 15:02:53,129 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((!(a_t == 0) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(1 <= c_dr_i)) || !(0 <= q_buf_0 + 2147483648)) || !(p_dw_pc == 0)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(c_last_read <= 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || (((__retres1 == 0 && 1 <= p_dw_st) && c_dr_st == \old(c_dr_st)) && p_dw_st <= 1)) || !(q_free <= 0)) || !(#NULL == 0)) || !(c_dr_i <= 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(\old(p_dw_st) == 1)) || !(q_write_ev == 1)) || !(p_dw_i == 1)) || !(\valid[2] == 1)) || !(0 <= q_free)) || !(p_last_write <= 2147483647)) || !(0 <= c_last_read)) || !(q_read_ev == 2)) || !(\old(c_dr_st) <= 0)) || !(0 <= \old(c_dr_st))) && (((((((((((((((((((((((((((((!(a_t == 0) || !(q_read_ev == 1)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(0 <= q_buf_0 + 2147483648)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(\old(p_dw_st) == 2)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(p_dw_pc == 1)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(c_num_read == 1)) || !(#NULL == 0)) || !(c_last_read == q_buf_0)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(1 <= \old(c_dr_st))) || !(\valid[2] == 1)) || !(q_free == 1)) || !(p_last_write <= 2147483647)) || !(c_last_read == p_last_write)) || ((((__retres1 == 1 && p_dw_st <= 2) && 1 <= c_dr_st) && c_dr_st <= 1) && 2 <= p_dw_st)) || !(\old(c_dr_st) <= 1)) || !(1 == c_dr_i))) && ((((((((!(2 <= \old(p_dw_st)) || !(c_num_read <= p_num_write)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc == 1)) || !(q_write_ev == 2)) || !(q_free == 1)) || 2 <= p_dw_st) || !(c_last_read == p_last_write)) [2022-11-23 15:02:53,130 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((!(a_t == 0) || !(q_read_ev == 1)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(0 <= q_buf_0 + 2147483648)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(\old(p_dw_st) == 2)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(p_dw_pc == 1)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(c_num_read == 1)) || !(#NULL == 0)) || !(c_last_read == q_buf_0)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(1 <= \old(c_dr_st))) || !(\valid[2] == 1)) || !(q_free == 1)) || !(p_last_write <= 2147483647)) || (((((__retres1 == 1 && tmp == \result) && c_dr_st == \old(c_dr_st)) && __retres1 == 0) && \result == __retres1) && p_dw_st == 0)) || !(c_last_read == p_last_write)) || !(\old(c_dr_st) <= 1)) || !(1 == c_dr_i)) && (((((((((((((((((((((((((((((((((!(a_t == 0) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(1 <= c_dr_i)) || !(0 <= q_buf_0 + 2147483648)) || !(p_dw_pc == 0)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(c_last_read <= 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(q_free <= 0)) || !(#NULL == 0)) || !(c_dr_i <= 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(\old(p_dw_st) == 1)) || !(q_write_ev == 1)) || !(p_dw_i == 1)) || !(\valid[2] == 1)) || !(0 <= q_free)) || !(p_last_write <= 2147483647)) || (((((\old(p_dw_st) == p_dw_st && __retres1 == 0) && tmp == 0) && c_dr_st == \old(c_dr_st)) && __retres1 == 0) && \result == __retres1)) || !(0 <= c_last_read)) || !(q_read_ev == 2)) || !(\old(c_dr_st) <= 0)) || !(0 <= \old(c_dr_st))) [2022-11-23 15:02:53,173 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 15:02:53,173 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:02:53,174 INFO L158 Benchmark]: Toolchain (without parser) took 58813.73ms. Allocated memory was 161.5MB in the beginning and 339.7MB in the end (delta: 178.3MB). Free memory was 116.0MB in the beginning and 222.6MB in the end (delta: -106.6MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2022-11-23 15:02:53,175 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 134.2MB. Free memory was 99.4MB in the beginning and 99.3MB in the end (delta: 30.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:02:53,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.13ms. Allocated memory is still 161.5MB. Free memory was 115.4MB in the beginning and 103.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 15:02:53,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.24ms. Allocated memory is still 161.5MB. Free memory was 103.5MB in the beginning and 101.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:02:53,177 INFO L158 Benchmark]: Boogie Preprocessor took 53.17ms. Allocated memory is still 161.5MB. Free memory was 101.4MB in the beginning and 100.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:02:53,177 INFO L158 Benchmark]: RCFGBuilder took 695.93ms. Allocated memory is still 161.5MB. Free memory was 100.0MB in the beginning and 77.0MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 15:02:53,178 INFO L158 Benchmark]: TraceAbstraction took 57648.12ms. Allocated memory was 161.5MB in the beginning and 339.7MB in the end (delta: 178.3MB). Free memory was 76.2MB in the beginning and 227.9MB in the end (delta: -151.6MB). Peak memory consumption was 152.3MB. Max. memory is 16.1GB. [2022-11-23 15:02:53,178 INFO L158 Benchmark]: Witness Printer took 97.94ms. Allocated memory is still 339.7MB. Free memory was 227.9MB in the beginning and 222.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 15:02:53,182 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.25ms. Allocated memory is still 134.2MB. Free memory was 99.4MB in the beginning and 99.3MB in the end (delta: 30.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.13ms. Allocated memory is still 161.5MB. Free memory was 115.4MB in the beginning and 103.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.24ms. Allocated memory is still 161.5MB. Free memory was 103.5MB in the beginning and 101.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.17ms. Allocated memory is still 161.5MB. Free memory was 101.4MB in the beginning and 100.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 695.93ms. Allocated memory is still 161.5MB. Free memory was 100.0MB in the beginning and 77.0MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 57648.12ms. Allocated memory was 161.5MB in the beginning and 339.7MB in the end (delta: 178.3MB). Free memory was 76.2MB in the beginning and 227.9MB in the end (delta: -151.6MB). Peak memory consumption was 152.3MB. Max. memory is 16.1GB. * Witness Printer took 97.94ms. Allocated memory is still 339.7MB. Free memory was 227.9MB in the beginning and 222.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 4 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.5s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 786 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 777 mSDsluCounter, 2606 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1664 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2956 IncrementalHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 942 mSDtfsCounter, 2956 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 517 SyntacticMatches, 16 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 30.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=7, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 281 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 339 PreInvPairs, 411 NumberOfFragments, 3468 HoareAnnotationTreeSize, 339 FomulaSimplifications, 482 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 23 FomulaSimplificationsInter, 14990 FormulaSimplificationTreeSizeReductionInter, 7.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 909 NumberOfCodeBlocks, 909 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1051 ConstructedInterpolants, 0 QuantifiedInterpolants, 3340 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1147 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 229/304 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: OVERALL_TIME: 4.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 90, DAG_INTERPRETER_EARLY_EXITS: 7, TOOLS_POST_APPLICATIONS: 135, TOOLS_POST_TIME: 2.4s, TOOLS_POST_CALL_APPLICATIONS: 36, TOOLS_POST_CALL_TIME: 0.7s, TOOLS_POST_RETURN_APPLICATIONS: 30, TOOLS_POST_RETURN_TIME: 0.8s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 192, TOOLS_QUANTIFIERELIM_TIME: 3.7s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 281, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 36, DOMAIN_JOIN_TIME: 0.7s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 3, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 10, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 90, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 7, LOOP_SUMMARIZER_CACHE_MISSES: 7, LOOP_SUMMARIZER_OVERALL_TIME: 1.4s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.4s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 10, CALL_SUMMARIZER_APPLICATIONS: 30, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 2045, DAG_COMPRESSION_RETAINED_NODES: 238, 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: 105]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && tmp <= 2147483647) && p_last_write == 0) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && kernel_st == 1) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && q_read_ev <= 2) && q_write_ev == 2) && p_dw_st == 1) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && 0 <= tmp + 2147483648) && c_dr_pc == 0) && !(tmp == 0)) && p_dw_i == 1) && \valid[0] == 0) && 2 <= q_read_ev) && \valid[2] == 1) && #NULL == 0) && a_t == 0) && tmp___1 == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((!(a_t == 0) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(1 <= c_dr_i)) || !(0 <= q_buf_0 + 2147483648)) || !(p_dw_pc == 0)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(c_last_read <= 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || (((__retres1 == 0 && 1 <= p_dw_st) && c_dr_st == \old(c_dr_st)) && p_dw_st <= 1)) || !(q_free <= 0)) || !(#NULL == 0)) || !(c_dr_i <= 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(\old(p_dw_st) == 1)) || !(q_write_ev == 1)) || !(p_dw_i == 1)) || !(\valid[2] == 1)) || !(0 <= q_free)) || !(p_last_write <= 2147483647)) || !(0 <= c_last_read)) || !(q_read_ev == 2)) || !(\old(c_dr_st) <= 0)) || !(0 <= \old(c_dr_st))) && (((((((((((((((((((((((((((((!(a_t == 0) || !(q_read_ev == 1)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(0 <= q_buf_0 + 2147483648)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(\old(p_dw_st) == 2)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(p_dw_pc == 1)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(c_num_read == 1)) || !(#NULL == 0)) || !(c_last_read == q_buf_0)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(1 <= \old(c_dr_st))) || !(\valid[2] == 1)) || !(q_free == 1)) || !(p_last_write <= 2147483647)) || !(c_last_read == p_last_write)) || ((((__retres1 == 1 && p_dw_st <= 2) && 1 <= c_dr_st) && c_dr_st <= 1) && 2 <= p_dw_st)) || !(\old(c_dr_st) <= 1)) || !(1 == c_dr_i))) && ((((((((!(2 <= \old(p_dw_st)) || !(c_num_read <= p_num_write)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc == 1)) || !(q_write_ev == 2)) || !(q_free == 1)) || 2 <= p_dw_st) || !(c_last_read == p_last_write)) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st) || (((((((((((((((((((((((((0 <= q_free && c_num_read == 0) && p_dw_pc <= 1) && p_last_write == q_buf_0) && 0 <= p_dw_pc) && c_last_read == 0) && 0 <= p_num_write) && 1 == c_dr_i) && p_dw_st <= 2) && kernel_st == 1) && p_num_write <= 1) && q_read_ev <= 2) && tmp___1 <= 1) && 0 <= q_buf_0 + 2147483648) && q_write_ev == 2) && q_free <= 1) && c_dr_pc == 0) && p_dw_i == 1) && 2 <= q_read_ev) && #NULL == 0) && p_last_write <= 2147483647) && 0 <= tmp___1) && a_t == 0) && 2 <= p_dw_st) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2)) || ((((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && kernel_st == 0) && q_write_ev == q_read_ev) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && q_write_ev == 2) && p_dw_st == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && c_dr_pc == 0) && p_dw_i == 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && c_last_read == p_last_write) && a_t == 0) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(a_t == 0) || !(q_read_ev == 1)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(0 <= q_buf_0 + 2147483648)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(\old(p_dw_st) == 2)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(p_dw_pc == 1)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(c_num_read == 1)) || !(#NULL == 0)) || !(c_last_read == q_buf_0)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(1 <= \old(c_dr_st))) || !(\valid[2] == 1)) || !(q_free == 1)) || !(p_last_write <= 2147483647)) || (((((__retres1 == 1 && tmp == \result) && c_dr_st == \old(c_dr_st)) && __retres1 == 0) && \result == __retres1) && p_dw_st == 0)) || !(c_last_read == p_last_write)) || !(\old(c_dr_st) <= 1)) || !(1 == c_dr_i)) && (((((((((((((((((((((((((((((((((!(a_t == 0) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(1 <= c_dr_i)) || !(0 <= q_buf_0 + 2147483648)) || !(p_dw_pc == 0)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(c_last_read <= 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(q_free <= 0)) || !(#NULL == 0)) || !(c_dr_i <= 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(\old(p_dw_st) == 1)) || !(q_write_ev == 1)) || !(p_dw_i == 1)) || !(\valid[2] == 1)) || !(0 <= q_free)) || !(p_last_write <= 2147483647)) || (((((\old(p_dw_st) == p_dw_st && __retres1 == 0) && tmp == 0) && c_dr_st == \old(c_dr_st)) && __retres1 == 0) && \result == __retres1)) || !(0 <= c_last_read)) || !(q_read_ev == 2)) || !(\old(c_dr_st) <= 0)) || !(0 <= \old(c_dr_st))) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st) || ((((((((((((((((((((((((((((((((((((((((((((p_last_write <= 0 && 1 <= p_dw_i) && 1 <= q_free) && 1 <= kernel_st) && unknown-#length-unknown[3] == 12) && p_num_write <= 0) && c_dr_st <= 0) && 0 <= q_buf_0) && 0 <= #NULL) && kernel_st <= 1) && 1 <= c_dr_i) && 0 <= c_dr_pc) && c_num_read <= 0) && c_last_read <= 0) && 0 <= p_last_write) && p_dw_pc <= 0) && c_dr_i <= 1) && 0 <= p_dw_pc) && 0 <= p_num_write) && a_t <= 0) && 2 <= q_write_ev) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && #NULL <= 0) && p_dw_i <= 1) && 0 <= c_dr_st) && q_read_ev <= 2) && q_free <= 1) && q_write_ev <= 2) && p_dw_st == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && 0 <= a_t) && #NULL <= 0) && \valid[0] == 0) && 2 <= q_read_ev) && \valid[2] == 1) && c_dr_pc <= 0) && unknown-#memory_int-unknown[1][0] == 48) && 0 <= #NULL) && unknown-#memory_int-unknown[1][1] == 0) && 0 <= c_num_read) && q_buf_0 <= 0) && 0 <= c_last_read) && 0 < unknown-#StackHeapBarrier-unknown)) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2)) || (((((((((((((((((((((((0 <= q_free && c_num_read == 0) && p_dw_pc <= 1) && p_last_write == q_buf_0) && 0 <= p_dw_pc) && c_last_read == 0) && 0 <= p_num_write) && 1 == c_dr_i) && p_dw_st <= 2) && kernel_st == 1) && p_num_write <= 1) && q_read_ev <= 2) && 0 <= q_buf_0 + 2147483648) && q_write_ev == 2) && q_free <= 1) && c_dr_pc == 0) && p_dw_i == 1) && 2 <= q_read_ev) && #NULL == 0) && p_last_write <= 2147483647) && a_t == 0) && 2 <= p_dw_st) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st) || (((((((((((((((((((((((((0 <= q_free && c_num_read == 0) && p_dw_pc <= 1) && p_last_write == q_buf_0) && 0 <= p_dw_pc) && c_last_read == 0) && 0 <= p_num_write) && 1 == c_dr_i) && p_dw_st <= 2) && kernel_st == 1) && p_num_write <= 1) && q_read_ev <= 2) && tmp___1 <= 1) && 0 <= q_buf_0 + 2147483648) && q_write_ev == 2) && q_free <= 1) && c_dr_pc == 0) && p_dw_i == 1) && 2 <= q_read_ev) && #NULL == 0) && p_last_write <= 2147483647) && 0 <= tmp___1) && a_t == 0) && 2 <= p_dw_st) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2)) || ((((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && tmp <= 2147483647) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && kernel_st == 1) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && q_read_ev <= 2) && q_write_ev == 2) && p_dw_st == 1) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && 0 <= tmp + 2147483648) && c_dr_pc == 0) && !(tmp == 0)) && p_dw_i == 1) && \valid[0] == 0) && 2 <= q_read_ev) && \valid[2] == 1) && #NULL == 0) && c_last_read == p_last_write) && a_t == 0) && tmp___1 == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2)) || ((((((((((((((((((((((((((((((((p_dw_pc == 0 && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && tmp <= 2147483647) && 0 <= p_dw_st) && c_last_read == 0) && 1 == c_dr_i) && p_dw_st <= 2) && kernel_st == 1) && q_free == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 0 <= q_buf_0 + 2147483648) && q_write_ev == 2) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && q_read_ev == 2) && 0 <= tmp + 2147483648) && c_dr_pc == 0) && !(tmp == 0)) && p_dw_i == 1) && \valid[0] == 0) && p_num_write == 1) && \valid[2] == 1) && #NULL == 0) && p_last_write <= 2147483647) && a_t == 0) && tmp___1 == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && q_write_ev == 2) && c_last_read == p_last_write) || (((((((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && c_num_read == 0) && !(tmp___0 == 0)) && p_last_write == q_buf_0) && tmp <= 2147483647) && 0 <= tmp___0 + 2147483648) && c_last_read == 0) && 1 == c_dr_i) && kernel_st == 1) && q_free == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && tmp___0 <= 2147483647) && 0 <= q_buf_0 + 2147483648) && p_dw_pc == 1) && q_write_ev == 2) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && q_read_ev == 2) && 0 <= tmp + 2147483648) && c_dr_pc == 0) && !(tmp == 0)) && 2 == p_dw_st) && p_dw_i == 1) && \valid[0] == 0) && p_num_write == 1) && \valid[2] == 1) && #NULL == 0) && p_last_write <= 2147483647) && a_t == 0) && tmp___1 == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && c_dr_st == 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) || (((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && c_num_read == 0) && p_last_write == q_buf_0) && tmp <= 2147483647) && c_last_read == 0) && 1 == c_dr_i) && kernel_st == 1) && q_free == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 0 <= q_buf_0 + 2147483648) && p_dw_pc == 1) && q_write_ev == 2) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && q_read_ev == 2) && 0 <= tmp + 2147483648) && c_dr_pc == 0) && !(tmp == 0)) && 2 == p_dw_st) && p_dw_i == 1) && \valid[0] == 0) && p_num_write == 1) && \valid[2] == 1) && #NULL == 0) && p_last_write <= 2147483647) && a_t == 0) && tmp___1 == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: (((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st) || (((((((((((((((((((((((((0 <= q_free && c_num_read == 0) && p_dw_pc <= 1) && p_last_write == q_buf_0) && 0 <= p_dw_pc) && c_last_read == 0) && 0 <= p_num_write) && 1 == c_dr_i) && p_dw_st <= 2) && kernel_st == 1) && p_num_write <= 1) && q_read_ev <= 2) && tmp___1 <= 1) && 0 <= q_buf_0 + 2147483648) && q_write_ev == 2) && q_free <= 1) && c_dr_pc == 0) && p_dw_i == 1) && 2 <= q_read_ev) && #NULL == 0) && p_last_write <= 2147483647) && 0 <= tmp___1) && a_t == 0) && 2 <= p_dw_st) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2)) || ((((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-23 15:02:53,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb3fe408-1aeb-413c-94b8-a2bb18eda2c4/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE