./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI --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 d974e781ffea1b31efc329a775e4694ebddd3772fc019bafad0898da50a9d8c1 --- 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-5e519f3 [2022-11-03 01:56:20,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:56:20,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:56:20,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:56:20,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:56:20,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:56:20,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:56:20,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:56:20,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:56:20,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:56:20,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:56:20,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:56:20,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:56:20,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:56:20,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:56:20,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:56:20,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:56:20,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:56:20,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:56:20,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:56:20,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:56:20,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:56:20,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:56:20,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:56:20,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:56:20,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:56:20,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:56:20,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:56:20,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:56:20,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:56:20,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:56:20,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:56:20,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:56:20,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:56:20,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:56:20,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:56:20,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:56:20,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:56:20,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:56:20,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:56:20,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:56:20,793 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:56:20,837 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:56:20,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:56:20,838 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:56:20,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:56:20,839 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:56:20,839 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:56:20,840 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:56:20,840 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:56:20,840 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:56:20,840 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:56:20,841 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:56:20,842 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:56:20,842 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:56:20,842 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:56:20,842 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:56:20,843 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:56:20,843 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:56:20,843 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:56:20,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:56:20,844 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:56:20,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:56:20,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:56:20,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:56:20,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:56:20,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:56:20,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:56:20,846 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:56:20,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:56:20,846 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:56:20,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:56:20,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:56:20,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:56:20,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:56:20,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:56:20,848 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:56:20,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:56:20,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:56:20,849 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:56:20,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:56:20,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:56:20,849 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:56:20,850 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_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/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_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI 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 -> d974e781ffea1b31efc329a775e4694ebddd3772fc019bafad0898da50a9d8c1 [2022-11-03 01:56:21,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:56:21,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:56:21,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:56:21,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:56:21,141 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:56:21,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-11-03 01:56:21,201 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/data/5198ebcd6/8356e8214914418aa50958667d9568d1/FLAG1a384b938 [2022-11-03 01:56:21,773 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:56:21,774 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-11-03 01:56:21,789 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/data/5198ebcd6/8356e8214914418aa50958667d9568d1/FLAG1a384b938 [2022-11-03 01:56:22,044 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/data/5198ebcd6/8356e8214914418aa50958667d9568d1 [2022-11-03 01:56:22,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:56:22,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:56:22,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:56:22,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:56:22,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:56:22,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:56:22" (1/1) ... [2022-11-03 01:56:22,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7daee8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22, skipping insertion in model container [2022-11-03 01:56:22,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:56:22" (1/1) ... [2022-11-03 01:56:22,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:56:22,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:56:22,310 WARN L230 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_c7eb928c-909d-445d-ac56-1a3c306192fc/sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-03 01:56:22,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:56:22,622 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:56:22,633 WARN L230 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_c7eb928c-909d-445d-ac56-1a3c306192fc/sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-03 01:56:22,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:56:22,707 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:56:22,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22 WrapperNode [2022-11-03 01:56:22,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:56:22,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:56:22,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:56:22,709 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:56:22,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22" (1/1) ... [2022-11-03 01:56:22,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22" (1/1) ... [2022-11-03 01:56:22,797 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-11-03 01:56:22,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:56:22,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:56:22,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:56:22,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:56:22,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22" (1/1) ... [2022-11-03 01:56:22,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22" (1/1) ... [2022-11-03 01:56:22,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22" (1/1) ... [2022-11-03 01:56:22,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22" (1/1) ... [2022-11-03 01:56:22,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22" (1/1) ... [2022-11-03 01:56:22,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22" (1/1) ... [2022-11-03 01:56:22,853 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22" (1/1) ... [2022-11-03 01:56:22,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22" (1/1) ... [2022-11-03 01:56:22,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:56:22,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:56:22,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:56:22,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:56:22,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22" (1/1) ... [2022-11-03 01:56:22,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:56:22,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:22,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:56:22,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:56:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:56:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 01:56:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:56:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:56:22,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:56:22,964 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-03 01:56:22,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-03 01:56:22,964 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-03 01:56:22,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-03 01:56:22,964 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-03 01:56:22,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-03 01:56:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:56:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 01:56:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:56:22,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:56:22,967 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 01:56:23,113 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:56:23,130 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:56:23,777 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:56:24,505 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:56:24,506 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 01:56:24,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:56:24 BoogieIcfgContainer [2022-11-03 01:56:24,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:56:24,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:56:24,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:56:24,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:56:24,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:56:22" (1/3) ... [2022-11-03 01:56:24,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf8475a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:56:24, skipping insertion in model container [2022-11-03 01:56:24,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:56:22" (2/3) ... [2022-11-03 01:56:24,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf8475a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:56:24, skipping insertion in model container [2022-11-03 01:56:24,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:56:24" (3/3) ... [2022-11-03 01:56:24,522 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i [2022-11-03 01:56:24,531 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 01:56:24,541 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:56:24,541 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 01:56:24,541 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 01:56:24,631 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 01:56:24,679 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 01:56:24,697 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 247 flow [2022-11-03 01:56:24,703 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 247 flow [2022-11-03 01:56:24,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2022-11-03 01:56:24,779 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2022-11-03 01:56:24,779 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 01:56:24,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-03 01:56:24,786 INFO L118 LiptonReduction]: Number of co-enabled transitions 2192 [2022-11-03 01:56:30,736 INFO L133 LiptonReduction]: Checked pairs total: 5846 [2022-11-03 01:56:30,737 INFO L135 LiptonReduction]: Total number of compositions: 101 [2022-11-03 01:56:30,745 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2022-11-03 01:56:30,819 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 854 states, 851 states have (on average 3.3678025851938895) internal successors, (2866), 853 states have internal predecessors, (2866), 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-03 01:56:30,837 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:56:30,848 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;@378c0dc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:56:30,849 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-03 01:56:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 854 states, 851 states have (on average 3.3678025851938895) internal successors, (2866), 853 states have internal predecessors, (2866), 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-03 01:56:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 01:56:30,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:30,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 01:56:30,861 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 01:56:30,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:30,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1120804, now seen corresponding path program 1 times [2022-11-03 01:56:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:30,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697539071] [2022-11-03 01:56:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:31,259 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-03 01:56:31,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:31,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697539071] [2022-11-03 01:56:31,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697539071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:31,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:31,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:56:31,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878563048] [2022-11-03 01:56:31,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:31,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:31,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:31,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:31,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:31,294 INFO L87 Difference]: Start difference. First operand has 854 states, 851 states have (on average 3.3678025851938895) internal successors, (2866), 853 states have internal predecessors, (2866), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-03 01:56:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:31,431 INFO L93 Difference]: Finished difference Result 692 states and 2139 transitions. [2022-11-03 01:56:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:31,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Word has length 3 [2022-11-03 01:56:31,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:31,464 INFO L225 Difference]: With dead ends: 692 [2022-11-03 01:56:31,465 INFO L226 Difference]: Without dead ends: 662 [2022-11-03 01:56:31,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03 01:56:31,471 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:31,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-11-03 01:56:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2022-11-03 01:56:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 3.1164901664145233) internal successors, (2060), 661 states have internal predecessors, (2060), 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-03 01:56:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2022-11-03 01:56:31,563 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 3 [2022-11-03 01:56:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:31,564 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2022-11-03 01:56:31,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-03 01:56:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2022-11-03 01:56:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:56:31,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:31,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:31,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:56:31,566 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 01:56:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 284902421, now seen corresponding path program 1 times [2022-11-03 01:56:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:31,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045535472] [2022-11-03 01:56:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:31,853 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-03 01:56:31,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:31,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045535472] [2022-11-03 01:56:31,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045535472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:31,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:31,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:56:31,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649084991] [2022-11-03 01:56:31,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:31,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:31,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:31,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:31,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:31,864 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-03 01:56:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:31,973 INFO L93 Difference]: Finished difference Result 1095 states and 3266 transitions. [2022-11-03 01:56:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:31,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2022-11-03 01:56:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:31,981 INFO L225 Difference]: With dead ends: 1095 [2022-11-03 01:56:31,981 INFO L226 Difference]: Without dead ends: 933 [2022-11-03 01:56:31,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03 01:56:31,984 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:31,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:31,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2022-11-03 01:56:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 825. [2022-11-03 01:56:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 824 states have (on average 3.0024271844660193) internal successors, (2474), 824 states have internal predecessors, (2474), 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-03 01:56:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 2474 transitions. [2022-11-03 01:56:32,026 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 2474 transitions. Word has length 9 [2022-11-03 01:56:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:32,027 INFO L495 AbstractCegarLoop]: Abstraction has 825 states and 2474 transitions. [2022-11-03 01:56:32,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-03 01:56:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 2474 transitions. [2022-11-03 01:56:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:56:32,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:32,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:32,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:56:32,029 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 01:56:32,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash 241098869, now seen corresponding path program 1 times [2022-11-03 01:56:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:32,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981785661] [2022-11-03 01:56:32,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:32,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:32,282 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-03 01:56:32,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:32,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981785661] [2022-11-03 01:56:32,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981785661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:32,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:32,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:56:32,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259128845] [2022-11-03 01:56:32,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:32,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:32,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:32,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:32,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:32,286 INFO L87 Difference]: Start difference. First operand 825 states and 2474 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03 01:56:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:32,418 INFO L93 Difference]: Finished difference Result 864 states and 2519 transitions. [2022-11-03 01:56:32,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:32,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2022-11-03 01:56:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:32,425 INFO L225 Difference]: With dead ends: 864 [2022-11-03 01:56:32,426 INFO L226 Difference]: Without dead ends: 864 [2022-11-03 01:56:32,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:32,430 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:32,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 7 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:32,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2022-11-03 01:56:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 702. [2022-11-03 01:56:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 2.9686162624821684) internal successors, (2081), 701 states have internal predecessors, (2081), 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-03 01:56:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 2081 transitions. [2022-11-03 01:56:32,459 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 2081 transitions. Word has length 10 [2022-11-03 01:56:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:32,461 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 2081 transitions. [2022-11-03 01:56:32,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-03 01:56:32,461 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 2081 transitions. [2022-11-03 01:56:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:56:32,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:32,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:32,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:56:32,469 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 01:56:32,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1118300793, now seen corresponding path program 1 times [2022-11-03 01:56:32,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:32,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045943839] [2022-11-03 01:56:32,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:32,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:32,660 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-03 01:56:32,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:32,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045943839] [2022-11-03 01:56:32,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045943839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:32,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:32,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:56:32,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080758718] [2022-11-03 01:56:32,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:32,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:32,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:32,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:32,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:32,663 INFO L87 Difference]: Start difference. First operand 702 states and 2081 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-03 01:56:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:32,737 INFO L93 Difference]: Finished difference Result 694 states and 2051 transitions. [2022-11-03 01:56:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:32,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) Word has length 11 [2022-11-03 01:56:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:32,742 INFO L225 Difference]: With dead ends: 694 [2022-11-03 01:56:32,742 INFO L226 Difference]: Without dead ends: 694 [2022-11-03 01:56:32,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03 01:56:32,744 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:32,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:32,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-11-03 01:56:32,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2022-11-03 01:56:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 2.95959595959596) internal successors, (2051), 693 states have internal predecessors, (2051), 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-03 01:56:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 2051 transitions. [2022-11-03 01:56:32,764 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 2051 transitions. Word has length 11 [2022-11-03 01:56:32,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:32,765 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 2051 transitions. [2022-11-03 01:56:32,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-03 01:56:32,765 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 2051 transitions. [2022-11-03 01:56:32,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:56:32,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:32,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:32,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:56:32,767 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 01:56:32,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:32,767 INFO L85 PathProgramCache]: Analyzing trace with hash -307586676, now seen corresponding path program 1 times [2022-11-03 01:56:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:32,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493479385] [2022-11-03 01:56:32,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:32,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:32,877 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-03 01:56:32,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:32,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493479385] [2022-11-03 01:56:32,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493479385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:32,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:32,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:56:32,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476614331] [2022-11-03 01:56:32,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:32,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:32,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:32,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:32,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:32,880 INFO L87 Difference]: Start difference. First operand 694 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-03 01:56:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:32,958 INFO L93 Difference]: Finished difference Result 460 states and 1143 transitions. [2022-11-03 01:56:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:32,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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) Word has length 12 [2022-11-03 01:56:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:32,963 INFO L225 Difference]: With dead ends: 460 [2022-11-03 01:56:32,963 INFO L226 Difference]: Without dead ends: 460 [2022-11-03 01:56:32,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03 01:56:32,964 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:32,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-11-03 01:56:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2022-11-03 01:56:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 2.4901960784313726) internal successors, (1143), 459 states have internal predecessors, (1143), 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-03 01:56:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1143 transitions. [2022-11-03 01:56:32,977 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1143 transitions. Word has length 12 [2022-11-03 01:56:32,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:32,978 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 1143 transitions. [2022-11-03 01:56:32,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-03 01:56:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1143 transitions. [2022-11-03 01:56:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:32,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:32,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:32,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:56:32,980 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 01:56:32,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:32,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1321627731, now seen corresponding path program 1 times [2022-11-03 01:56:32,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:32,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334990056] [2022-11-03 01:56:32,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:32,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:33,152 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-03 01:56:33,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:33,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334990056] [2022-11-03 01:56:33,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334990056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:33,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:33,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:33,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660023612] [2022-11-03 01:56:33,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:33,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:33,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:33,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:33,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:33,155 INFO L87 Difference]: Start difference. First operand 460 states and 1143 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-03 01:56:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:33,283 INFO L93 Difference]: Finished difference Result 727 states and 1750 transitions. [2022-11-03 01:56:33,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:33,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 15 [2022-11-03 01:56:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:33,286 INFO L225 Difference]: With dead ends: 727 [2022-11-03 01:56:33,287 INFO L226 Difference]: Without dead ends: 523 [2022-11-03 01:56:33,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:33,287 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:33,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-11-03 01:56:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 425. [2022-11-03 01:56:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 2.400943396226415) internal successors, (1018), 424 states have internal predecessors, (1018), 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-03 01:56:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1018 transitions. [2022-11-03 01:56:33,301 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1018 transitions. Word has length 15 [2022-11-03 01:56:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:33,301 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 1018 transitions. [2022-11-03 01:56:33,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-03 01:56:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1018 transitions. [2022-11-03 01:56:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:33,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:33,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:33,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:56:33,303 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 01:56:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash 904256589, now seen corresponding path program 1 times [2022-11-03 01:56:33,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:33,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292535446] [2022-11-03 01:56:33,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:33,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:33,552 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-03 01:56:33,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:33,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292535446] [2022-11-03 01:56:33,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292535446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:33,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:33,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:33,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528822982] [2022-11-03 01:56:33,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:33,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:33,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:33,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:33,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:33,555 INFO L87 Difference]: Start difference. First operand 425 states and 1018 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-03 01:56:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:33,656 INFO L93 Difference]: Finished difference Result 268 states and 577 transitions. [2022-11-03 01:56:33,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:33,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2022-11-03 01:56:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:33,658 INFO L225 Difference]: With dead ends: 268 [2022-11-03 01:56:33,658 INFO L226 Difference]: Without dead ends: 262 [2022-11-03 01:56:33,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:33,659 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:33,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 9 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-03 01:56:33,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 256. [2022-11-03 01:56:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 2.152941176470588) internal successors, (549), 255 states have internal predecessors, (549), 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-03 01:56:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 549 transitions. [2022-11-03 01:56:33,667 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 549 transitions. Word has length 15 [2022-11-03 01:56:33,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:33,667 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 549 transitions. [2022-11-03 01:56:33,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-03 01:56:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 549 transitions. [2022-11-03 01:56:33,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 01:56:33,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:33,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:33,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 01:56:33,669 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 01:56:33,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1761270736, now seen corresponding path program 1 times [2022-11-03 01:56:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:33,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197162632] [2022-11-03 01:56:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:33,963 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-03 01:56:33,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:33,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197162632] [2022-11-03 01:56:33,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197162632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:33,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:33,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:33,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130130667] [2022-11-03 01:56:33,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:33,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:33,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:33,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:33,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:33,965 INFO L87 Difference]: Start difference. First operand 256 states and 549 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-03 01:56:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:34,075 INFO L93 Difference]: Finished difference Result 376 states and 789 transitions. [2022-11-03 01:56:34,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:34,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 18 [2022-11-03 01:56:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:34,077 INFO L225 Difference]: With dead ends: 376 [2022-11-03 01:56:34,077 INFO L226 Difference]: Without dead ends: 264 [2022-11-03 01:56:34,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:34,078 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 21 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:34,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-03 01:56:34,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 241. [2022-11-03 01:56:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.1) internal successors, (504), 240 states have internal predecessors, (504), 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-03 01:56:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 504 transitions. [2022-11-03 01:56:34,085 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 504 transitions. Word has length 18 [2022-11-03 01:56:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:34,086 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 504 transitions. [2022-11-03 01:56:34,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-03 01:56:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 504 transitions. [2022-11-03 01:56:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 01:56:34,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:34,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:34,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 01:56:34,088 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 01:56:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:34,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1681104012, now seen corresponding path program 2 times [2022-11-03 01:56:34,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:34,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323436382] [2022-11-03 01:56:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:34,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:34,337 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-03 01:56:34,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:34,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323436382] [2022-11-03 01:56:34,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323436382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:34,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:34,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:56:34,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879293379] [2022-11-03 01:56:34,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:34,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:56:34,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:34,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:56:34,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:34,339 INFO L87 Difference]: Start difference. First operand 241 states and 504 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-03 01:56:34,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:34,434 INFO L93 Difference]: Finished difference Result 205 states and 436 transitions. [2022-11-03 01:56:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:56:34,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 18 [2022-11-03 01:56:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:34,435 INFO L225 Difference]: With dead ends: 205 [2022-11-03 01:56:34,435 INFO L226 Difference]: Without dead ends: 111 [2022-11-03 01:56:34,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:34,436 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 68 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:34,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 7 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-03 01:56:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-03 01:56:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.1272727272727274) internal successors, (234), 110 states have internal predecessors, (234), 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-03 01:56:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 234 transitions. [2022-11-03 01:56:34,440 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 234 transitions. Word has length 18 [2022-11-03 01:56:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:34,440 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 234 transitions. [2022-11-03 01:56:34,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-03 01:56:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 234 transitions. [2022-11-03 01:56:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:56:34,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:34,442 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] [2022-11-03 01:56:34,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 01:56:34,442 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 01:56:34,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2035472486, now seen corresponding path program 1 times [2022-11-03 01:56:34,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:34,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206799613] [2022-11-03 01:56:34,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:34,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:35,565 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-03 01:56:35,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:35,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206799613] [2022-11-03 01:56:35,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206799613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:35,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:35,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:35,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989988187] [2022-11-03 01:56:35,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:35,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:56:35,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:35,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:56:35,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:56:35,568 INFO L87 Difference]: Start difference. First operand 111 states and 234 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03 01:56:35,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:35,786 INFO L93 Difference]: Finished difference Result 166 states and 332 transitions. [2022-11-03 01:56:35,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:56:35,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) Word has length 22 [2022-11-03 01:56:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:35,788 INFO L225 Difference]: With dead ends: 166 [2022-11-03 01:56:35,788 INFO L226 Difference]: Without dead ends: 100 [2022-11-03 01:56:35,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:56:35,789 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:35,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 21 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-03 01:56:35,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2022-11-03 01:56:35,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.9523809523809523) internal successors, (164), 84 states have internal predecessors, (164), 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-03 01:56:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 164 transitions. [2022-11-03 01:56:35,793 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 164 transitions. Word has length 22 [2022-11-03 01:56:35,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:35,793 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 164 transitions. [2022-11-03 01:56:35,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03 01:56:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 164 transitions. [2022-11-03 01:56:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:56:35,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:35,794 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] [2022-11-03 01:56:35,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 01:56:35,795 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 01:56:35,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:35,795 INFO L85 PathProgramCache]: Analyzing trace with hash -3179238, now seen corresponding path program 2 times [2022-11-03 01:56:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:35,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753909538] [2022-11-03 01:56:35,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:35,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:36,758 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-03 01:56:36,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:36,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753909538] [2022-11-03 01:56:36,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753909538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:36,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:36,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078536956] [2022-11-03 01:56:36,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:36,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:56:36,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:36,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:56:36,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:56:36,762 INFO L87 Difference]: Start difference. First operand 85 states and 164 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03 01:56:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:37,028 INFO L93 Difference]: Finished difference Result 99 states and 186 transitions. [2022-11-03 01:56:37,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:56:37,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) Word has length 22 [2022-11-03 01:56:37,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:37,029 INFO L225 Difference]: With dead ends: 99 [2022-11-03 01:56:37,029 INFO L226 Difference]: Without dead ends: 65 [2022-11-03 01:56:37,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:56:37,030 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:37,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 17 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-03 01:56:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-03 01:56:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.78125) internal successors, (114), 64 states have internal predecessors, (114), 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-03 01:56:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2022-11-03 01:56:37,033 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 22 [2022-11-03 01:56:37,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:37,034 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2022-11-03 01:56:37,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-03 01:56:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2022-11-03 01:56:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:56:37,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:37,036 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] [2022-11-03 01:56:37,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 01:56:37,036 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 01:56:37,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1361762394, now seen corresponding path program 3 times [2022-11-03 01:56:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:37,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109613259] [2022-11-03 01:56:37,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:37,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 01:56:37,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 01:56:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 01:56:37,265 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 01:56:37,265 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 01:56:37,266 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-03 01:56:37,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-03 01:56:37,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-03 01:56:37,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-03 01:56:37,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-03 01:56:37,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-03 01:56:37,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 01:56:37,272 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:37,279 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-03 01:56:37,279 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 01:56:37,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:56:37 BasicIcfg [2022-11-03 01:56:37,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 01:56:37,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 01:56:37,354 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 01:56:37,354 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 01:56:37,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:56:24" (3/4) ... [2022-11-03 01:56:37,356 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 01:56:37,443 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 01:56:37,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 01:56:37,444 INFO L158 Benchmark]: Toolchain (without parser) took 15396.67ms. Allocated memory was 94.4MB in the beginning and 249.6MB in the end (delta: 155.2MB). Free memory was 52.0MB in the beginning and 178.0MB in the end (delta: -126.0MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2022-11-03 01:56:37,444 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 94.4MB. Free memory was 70.4MB in the beginning and 70.3MB in the end (delta: 86.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:56:37,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 659.30ms. Allocated memory is still 94.4MB. Free memory was 51.8MB in the beginning and 57.1MB in the end (delta: -5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 01:56:37,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.81ms. Allocated memory is still 94.4MB. Free memory was 57.1MB in the beginning and 54.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:56:37,446 INFO L158 Benchmark]: Boogie Preprocessor took 72.21ms. Allocated memory is still 94.4MB. Free memory was 54.5MB in the beginning and 52.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:56:37,446 INFO L158 Benchmark]: RCFGBuilder took 1633.36ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 52.1MB in the beginning and 69.9MB in the end (delta: -17.8MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2022-11-03 01:56:37,446 INFO L158 Benchmark]: TraceAbstraction took 12841.53ms. Allocated memory was 113.2MB in the beginning and 249.6MB in the end (delta: 136.3MB). Free memory was 69.2MB in the beginning and 193.8MB in the end (delta: -124.6MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB. [2022-11-03 01:56:37,447 INFO L158 Benchmark]: Witness Printer took 90.14ms. Allocated memory is still 249.6MB. Free memory was 193.8MB in the beginning and 178.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 01:56:37,448 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.27ms. Allocated memory is still 94.4MB. Free memory was 70.4MB in the beginning and 70.3MB in the end (delta: 86.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 659.30ms. Allocated memory is still 94.4MB. Free memory was 51.8MB in the beginning and 57.1MB in the end (delta: -5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.81ms. Allocated memory is still 94.4MB. Free memory was 57.1MB in the beginning and 54.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.21ms. Allocated memory is still 94.4MB. Free memory was 54.5MB in the beginning and 52.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1633.36ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 52.1MB in the beginning and 69.9MB in the end (delta: -17.8MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12841.53ms. Allocated memory was 113.2MB in the beginning and 249.6MB in the end (delta: 136.3MB). Free memory was 69.2MB in the beginning and 193.8MB in the end (delta: -124.6MB). Peak memory consumption was 135.1MB. Max. memory is 16.1GB. * Witness Printer took 90.14ms. Allocated memory is still 249.6MB. Free memory was 193.8MB in the beginning and 178.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 124 PlacesBefore, 37 PlacesAfterwards, 116 TransitionsBefore, 28 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, 5846 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3222, positive: 3043, positive conditional: 0, positive unconditional: 3043, negative: 179, negative conditional: 0, negative unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1622, positive: 1554, positive conditional: 0, positive unconditional: 1554, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1622, positive: 1536, positive conditional: 0, positive unconditional: 1536, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 802, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 766, negative conditional: 0, negative unconditional: 766, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3222, positive: 1489, positive conditional: 0, positive unconditional: 1489, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 1622, unknown conditional: 0, unknown unconditional: 1622] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 155, Positive conditional cache size: 0, Positive unconditional cache size: 155, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L836] 0 pthread_t t745; [L837] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t745, ((void *)0), P0, ((void *)0))=-2, t745={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t746; [L839] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t746, ((void *)0), P1, ((void *)0))=-1, t745={5:0}, t746={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t747; [L841] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t747, ((void *)0), P2, ((void *)0))=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L795] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z [L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L802] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L807] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = z [L810] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 260 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 803 IncrementalHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 39 mSDtfsCounter, 803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=854occurred in iteration=0, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 412 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 915 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 01:56:37,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7eb928c-909d-445d-ac56-1a3c306192fc/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE