./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba --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 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --- 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-b5237d8 [2022-11-22 02:28:25,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:28:25,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:28:25,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:28:25,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:28:25,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:28:25,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:28:25,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:28:25,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:28:25,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:28:25,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:28:25,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:28:25,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:28:25,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:28:25,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:28:25,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:28:25,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:28:25,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:28:25,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:28:25,821 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:28:25,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:28:25,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:28:25,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:28:25,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:28:25,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:28:25,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:28:25,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:28:25,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:28:25,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:28:25,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:28:25,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:28:25,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:28:25,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:28:25,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:28:25,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:28:25,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:28:25,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:28:25,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:28:25,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:28:25,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:28:25,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:28:25,869 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 02:28:25,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:28:25,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:28:25,920 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:28:25,920 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:28:25,921 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:28:25,921 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:28:25,921 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:28:25,922 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:28:25,922 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:28:25,922 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:28:25,923 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:28:25,924 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:28:25,924 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:28:25,924 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:28:25,925 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:28:25,925 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:28:25,925 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:28:25,925 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:28:25,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:28:25,927 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:28:25,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:28:25,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:28:25,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:28:25,928 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 02:28:25,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:28:25,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 02:28:25,929 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:28:25,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 02:28:25,929 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:28:25,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 02:28:25,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:28:25,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:28:25,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:28:25,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:28:25,931 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:28:25,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:28:25,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 02:28:25,932 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:28:25,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:28:25,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 02:28:25,933 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:28:25,934 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_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/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_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba 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 -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 [2022-11-22 02:28:26,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:28:26,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:28:26,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:28:26,318 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:28:26,318 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:28:26,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-22 02:28:29,861 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:28:30,281 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:28:30,282 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-22 02:28:30,298 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/data/c6d87f0c0/be5ff2cbfd104180a8a44c7139998248/FLAGe80ccc207 [2022-11-22 02:28:30,319 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/data/c6d87f0c0/be5ff2cbfd104180a8a44c7139998248 [2022-11-22 02:28:30,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:28:30,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:28:30,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:28:30,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:28:30,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:28:30,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:28:30" (1/1) ... [2022-11-22 02:28:30,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552a5139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:30, skipping insertion in model container [2022-11-22 02:28:30,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:28:30" (1/1) ... [2022-11-22 02:28:30,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:28:30,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:28:30,618 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2022-11-22 02:28:30,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:28:30,908 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:28:30,928 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2022-11-22 02:28:31,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:28:31,079 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:28:31,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:31 WrapperNode [2022-11-22 02:28:31,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:28:31,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:28:31,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:28:31,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:28:31,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:31" (1/1) ... [2022-11-22 02:28:31,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:31" (1/1) ... [2022-11-22 02:28:31,194 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-11-22 02:28:31,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:28:31,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:28:31,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:28:31,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:28:31,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:31" (1/1) ... [2022-11-22 02:28:31,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:31" (1/1) ... [2022-11-22 02:28:31,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:31" (1/1) ... [2022-11-22 02:28:31,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:31" (1/1) ... [2022-11-22 02:28:31,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:31" (1/1) ... [2022-11-22 02:28:31,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:31" (1/1) ... [2022-11-22 02:28:31,224 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:31" (1/1) ... [2022-11-22 02:28:31,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:31" (1/1) ... [2022-11-22 02:28:31,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:28:31,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:28:31,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:28:31,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:28:31,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:31" (1/1) ... [2022-11-22 02:28:31,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:28:31,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:28:31,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:28:31,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:28:31,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 02:28:31,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 02:28:31,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:28:31,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 02:28:31,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:28:31,342 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 02:28:31,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 02:28:31,342 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 02:28:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 02:28:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 02:28:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 02:28:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:28:31,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 02:28:31,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:28:31,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:28:31,346 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 02:28:31,519 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:28:31,521 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:28:32,029 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:28:32,223 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:28:32,223 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 02:28:32,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:28:32 BoogieIcfgContainer [2022-11-22 02:28:32,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:28:32,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:28:32,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:28:32,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:28:32,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:28:30" (1/3) ... [2022-11-22 02:28:32,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4867ecf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:28:32, skipping insertion in model container [2022-11-22 02:28:32,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:31" (2/3) ... [2022-11-22 02:28:32,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4867ecf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:28:32, skipping insertion in model container [2022-11-22 02:28:32,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:28:32" (3/3) ... [2022-11-22 02:28:32,239 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-22 02:28:32,251 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 02:28:32,264 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:28:32,265 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-22 02:28:32,265 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 02:28:32,432 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 02:28:32,512 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 02:28:32,536 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 243 flow [2022-11-22 02:28:32,547 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 243 flow [2022-11-22 02:28:32,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-11-22 02:28:32,656 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-11-22 02:28:32,656 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 02:28:32,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-22 02:28:32,667 INFO L119 LiptonReduction]: Number of co-enabled transitions 1958 [2022-11-22 02:28:38,853 INFO L134 LiptonReduction]: Checked pairs total: 4811 [2022-11-22 02:28:38,853 INFO L136 LiptonReduction]: Total number of compositions: 103 [2022-11-22 02:28:38,864 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2022-11-22 02:28:38,948 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 578 states, 575 states have (on average 3.1408695652173915) internal successors, (1806), 577 states have internal predecessors, (1806), 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-22 02:28:38,971 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:28:38,979 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;@212c6dc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:28:38,979 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-22 02:28:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 578 states, 575 states have (on average 3.1408695652173915) internal successors, (1806), 577 states have internal predecessors, (1806), 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-22 02:28:38,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 02:28:38,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:38,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 02:28:38,992 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 02:28:38,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:38,998 INFO L85 PathProgramCache]: Analyzing trace with hash 462639582, now seen corresponding path program 1 times [2022-11-22 02:28:39,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:39,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521248456] [2022-11-22 02:28:39,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:39,579 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-22 02:28:39,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:39,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521248456] [2022-11-22 02:28:39,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521248456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:39,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:39,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 02:28:39,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125683784] [2022-11-22 02:28:39,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:39,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:28:39,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:39,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:28:39,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:28:39,621 INFO L87 Difference]: Start difference. First operand has 578 states, 575 states have (on average 3.1408695652173915) internal successors, (1806), 577 states have internal predecessors, (1806), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-22 02:28:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:39,770 INFO L93 Difference]: Finished difference Result 470 states and 1409 transitions. [2022-11-22 02:28:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:28:39,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-22 02:28:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:39,792 INFO L225 Difference]: With dead ends: 470 [2022-11-22 02:28:39,793 INFO L226 Difference]: Without dead ends: 450 [2022-11-22 02:28:39,794 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-22 02:28:39,798 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:39,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-11-22 02:28:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2022-11-22 02:28:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.024498886414254) internal successors, (1358), 449 states have internal predecessors, (1358), 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-22 02:28:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2022-11-22 02:28:39,892 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 5 [2022-11-22 02:28:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:39,893 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2022-11-22 02:28:39,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-22 02:28:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2022-11-22 02:28:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 02:28:39,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:39,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:39,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:28:39,897 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 02:28:39,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:39,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1619539899, now seen corresponding path program 1 times [2022-11-22 02:28:39,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:39,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800926799] [2022-11-22 02:28:39,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:39,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:40,321 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-22 02:28:40,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:40,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800926799] [2022-11-22 02:28:40,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800926799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:40,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:40,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 02:28:40,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559145515] [2022-11-22 02:28:40,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:40,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:28:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:40,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:28:40,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:28:40,326 INFO L87 Difference]: Start difference. First operand 450 states and 1358 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-22 02:28:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:40,479 INFO L93 Difference]: Finished difference Result 698 states and 2014 transitions. [2022-11-22 02:28:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:28:40,481 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-22 02:28:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:40,488 INFO L225 Difference]: With dead ends: 698 [2022-11-22 02:28:40,494 INFO L226 Difference]: Without dead ends: 644 [2022-11-22 02:28:40,496 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-22 02:28:40,499 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:40,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:40,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-11-22 02:28:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 584. [2022-11-22 02:28:40,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 583 states have (on average 2.9639794168096056) internal successors, (1728), 583 states have internal predecessors, (1728), 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-22 02:28:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1728 transitions. [2022-11-22 02:28:40,579 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1728 transitions. Word has length 9 [2022-11-22 02:28:40,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:40,580 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 1728 transitions. [2022-11-22 02:28:40,581 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-22 02:28:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1728 transitions. [2022-11-22 02:28:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 02:28:40,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:40,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:40,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 02:28:40,584 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 02:28:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1333869612, now seen corresponding path program 1 times [2022-11-22 02:28:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:40,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697105317] [2022-11-22 02:28:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:40,903 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-22 02:28:40,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:40,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697105317] [2022-11-22 02:28:40,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697105317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:40,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:40,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:28:40,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509380647] [2022-11-22 02:28:40,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:40,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:28:40,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:40,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:28:40,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:28:40,911 INFO L87 Difference]: Start difference. First operand 584 states and 1728 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-22 02:28:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:41,051 INFO L93 Difference]: Finished difference Result 617 states and 1780 transitions. [2022-11-22 02:28:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:28:41,052 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-22 02:28:41,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:41,059 INFO L225 Difference]: With dead ends: 617 [2022-11-22 02:28:41,059 INFO L226 Difference]: Without dead ends: 617 [2022-11-22 02:28:41,061 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-22 02:28:41,066 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:41,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-22 02:28:41,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 554. [2022-11-22 02:28:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 2.9367088607594938) internal successors, (1624), 553 states have internal predecessors, (1624), 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-22 02:28:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1624 transitions. [2022-11-22 02:28:41,113 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1624 transitions. Word has length 10 [2022-11-22 02:28:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:41,116 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 1624 transitions. [2022-11-22 02:28:41,116 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-22 02:28:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1624 transitions. [2022-11-22 02:28:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 02:28:41,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:41,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:41,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 02:28:41,130 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 02:28:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:41,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1664510058, now seen corresponding path program 1 times [2022-11-22 02:28:41,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:41,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612723534] [2022-11-22 02:28:41,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:41,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:41,397 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-22 02:28:41,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:41,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612723534] [2022-11-22 02:28:41,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612723534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:41,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:41,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:28:41,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762052427] [2022-11-22 02:28:41,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:41,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:28:41,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:41,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:28:41,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:28:41,407 INFO L87 Difference]: Start difference. First operand 554 states and 1624 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-22 02:28:41,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:41,558 INFO L93 Difference]: Finished difference Result 593 states and 1707 transitions. [2022-11-22 02:28:41,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:28:41,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-22 02:28:41,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:41,564 INFO L225 Difference]: With dead ends: 593 [2022-11-22 02:28:41,564 INFO L226 Difference]: Without dead ends: 593 [2022-11-22 02:28:41,565 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-22 02:28:41,566 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:41,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 6 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-11-22 02:28:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 512. [2022-11-22 02:28:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 2.9178082191780823) internal successors, (1491), 511 states have internal predecessors, (1491), 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-22 02:28:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1491 transitions. [2022-11-22 02:28:41,593 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1491 transitions. Word has length 11 [2022-11-22 02:28:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:41,593 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 1491 transitions. [2022-11-22 02:28:41,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-22 02:28:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1491 transitions. [2022-11-22 02:28:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:28:41,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:41,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:41,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 02:28:41,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 02:28:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash 444573691, now seen corresponding path program 1 times [2022-11-22 02:28:41,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:41,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687788292] [2022-11-22 02:28:41,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:41,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:41,802 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-22 02:28:41,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:41,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687788292] [2022-11-22 02:28:41,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687788292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:41,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:41,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:28:41,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223547667] [2022-11-22 02:28:41,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:41,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:28:41,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:41,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:28:41,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:28:41,816 INFO L87 Difference]: Start difference. First operand 512 states and 1491 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-22 02:28:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:41,966 INFO L93 Difference]: Finished difference Result 647 states and 1842 transitions. [2022-11-22 02:28:41,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:28:41,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-22 02:28:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:41,973 INFO L225 Difference]: With dead ends: 647 [2022-11-22 02:28:41,974 INFO L226 Difference]: Without dead ends: 512 [2022-11-22 02:28:41,974 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-22 02:28:41,975 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:41,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:41,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-11-22 02:28:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 395. [2022-11-22 02:28:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 2.8629441624365484) internal successors, (1128), 394 states have internal predecessors, (1128), 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-22 02:28:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1128 transitions. [2022-11-22 02:28:42,002 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1128 transitions. Word has length 12 [2022-11-22 02:28:42,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:42,002 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 1128 transitions. [2022-11-22 02:28:42,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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-22 02:28:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1128 transitions. [2022-11-22 02:28:42,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:28:42,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:42,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:42,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 02:28:42,006 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 02:28:42,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:42,006 INFO L85 PathProgramCache]: Analyzing trace with hash -60205317, now seen corresponding path program 1 times [2022-11-22 02:28:42,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:42,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409695839] [2022-11-22 02:28:42,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:42,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:42,252 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-22 02:28:42,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:42,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409695839] [2022-11-22 02:28:42,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409695839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:42,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:42,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:28:42,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711855392] [2022-11-22 02:28:42,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:42,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:28:42,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:42,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:28:42,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:28:42,257 INFO L87 Difference]: Start difference. First operand 395 states and 1128 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-22 02:28:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:42,396 INFO L93 Difference]: Finished difference Result 548 states and 1557 transitions. [2022-11-22 02:28:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:28:42,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-22 02:28:42,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:42,401 INFO L225 Difference]: With dead ends: 548 [2022-11-22 02:28:42,401 INFO L226 Difference]: Without dead ends: 308 [2022-11-22 02:28:42,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:28:42,402 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3 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-22 02:28:42,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:42,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-22 02:28:42,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 281. [2022-11-22 02:28:42,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 2.7714285714285714) internal successors, (776), 280 states have internal predecessors, (776), 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-22 02:28:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 776 transitions. [2022-11-22 02:28:42,420 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 776 transitions. Word has length 12 [2022-11-22 02:28:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:42,420 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 776 transitions. [2022-11-22 02:28:42,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-22 02:28:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 776 transitions. [2022-11-22 02:28:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 02:28:42,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:42,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:42,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 02:28:42,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 02:28:42,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:42,425 INFO L85 PathProgramCache]: Analyzing trace with hash 24906506, now seen corresponding path program 1 times [2022-11-22 02:28:42,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:42,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919965925] [2022-11-22 02:28:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:42,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:42,676 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-22 02:28:42,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:42,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919965925] [2022-11-22 02:28:42,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919965925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:42,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:42,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:28:42,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529374616] [2022-11-22 02:28:42,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:42,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:28:42,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:42,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:28:42,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:28:42,680 INFO L87 Difference]: Start difference. First operand 281 states and 776 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-22 02:28:42,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:42,812 INFO L93 Difference]: Finished difference Result 281 states and 693 transitions. [2022-11-22 02:28:42,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:28:42,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-11-22 02:28:42,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:42,815 INFO L225 Difference]: With dead ends: 281 [2022-11-22 02:28:42,815 INFO L226 Difference]: Without dead ends: 213 [2022-11-22 02:28:42,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:28:42,816 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:42,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:42,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-22 02:28:42,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-11-22 02:28:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.4339622641509435) internal successors, (516), 212 states have internal predecessors, (516), 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-22 02:28:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 516 transitions. [2022-11-22 02:28:42,827 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 516 transitions. Word has length 14 [2022-11-22 02:28:42,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:42,827 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 516 transitions. [2022-11-22 02:28:42,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-22 02:28:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 516 transitions. [2022-11-22 02:28:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 02:28:42,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:42,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:42,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 02:28:42,830 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 02:28:42,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:42,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1592115763, now seen corresponding path program 1 times [2022-11-22 02:28:42,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:42,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28669479] [2022-11-22 02:28:42,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:42,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:43,184 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-22 02:28:43,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:43,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28669479] [2022-11-22 02:28:43,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28669479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:43,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:43,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:28:43,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117542762] [2022-11-22 02:28:43,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:43,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:28:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:43,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:28:43,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:28:43,190 INFO L87 Difference]: Start difference. First operand 213 states and 516 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-22 02:28:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:43,373 INFO L93 Difference]: Finished difference Result 183 states and 407 transitions. [2022-11-22 02:28:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:28:43,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2022-11-22 02:28:43,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:43,375 INFO L225 Difference]: With dead ends: 183 [2022-11-22 02:28:43,375 INFO L226 Difference]: Without dead ends: 145 [2022-11-22 02:28:43,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:28:43,376 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:43,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 12 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:28:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-22 02:28:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-11-22 02:28:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.1944444444444446) internal successors, (316), 144 states have internal predecessors, (316), 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-22 02:28:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 316 transitions. [2022-11-22 02:28:43,384 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 316 transitions. Word has length 16 [2022-11-22 02:28:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:43,384 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 316 transitions. [2022-11-22 02:28:43,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-22 02:28:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 316 transitions. [2022-11-22 02:28:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 02:28:43,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:43,386 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-22 02:28:43,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 02:28:43,386 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 02:28:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:43,387 INFO L85 PathProgramCache]: Analyzing trace with hash 884472889, now seen corresponding path program 1 times [2022-11-22 02:28:43,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:43,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530823035] [2022-11-22 02:28:43,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:43,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:43,720 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-22 02:28:43,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:43,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530823035] [2022-11-22 02:28:43,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530823035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:43,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:43,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:28:43,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340796136] [2022-11-22 02:28:43,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:43,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:28:43,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:43,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:28:43,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:28:43,724 INFO L87 Difference]: Start difference. First operand 145 states and 316 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-22 02:28:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:43,881 INFO L93 Difference]: Finished difference Result 131 states and 286 transitions. [2022-11-22 02:28:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:28:43,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-22 02:28:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:43,884 INFO L225 Difference]: With dead ends: 131 [2022-11-22 02:28:43,884 INFO L226 Difference]: Without dead ends: 121 [2022-11-22 02:28:43,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:28:43,885 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:43,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 10 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-22 02:28:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-11-22 02:28:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.2333333333333334) internal successors, (268), 120 states have internal predecessors, (268), 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-22 02:28:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 268 transitions. [2022-11-22 02:28:43,892 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 268 transitions. Word has length 18 [2022-11-22 02:28:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:43,892 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 268 transitions. [2022-11-22 02:28:43,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-22 02:28:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 268 transitions. [2022-11-22 02:28:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:28:43,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:43,894 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] [2022-11-22 02:28:43,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 02:28:43,894 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 02:28:43,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:43,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1416615187, now seen corresponding path program 1 times [2022-11-22 02:28:43,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:43,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993424005] [2022-11-22 02:28:43,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:43,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:45,086 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-22 02:28:45,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:45,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993424005] [2022-11-22 02:28:45,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993424005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:45,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:45,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:28:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959660320] [2022-11-22 02:28:45,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:45,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:28:45,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:45,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:28:45,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:28:45,095 INFO L87 Difference]: Start difference. First operand 121 states and 268 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-22 02:28:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:45,366 INFO L93 Difference]: Finished difference Result 204 states and 430 transitions. [2022-11-22 02:28:45,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:28:45,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2022-11-22 02:28:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:45,368 INFO L225 Difference]: With dead ends: 204 [2022-11-22 02:28:45,368 INFO L226 Difference]: Without dead ends: 146 [2022-11-22 02:28:45,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:28:45,369 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:45,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 18 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:28:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-22 02:28:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 101. [2022-11-22 02:28:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.08) internal successors, (208), 100 states have internal predecessors, (208), 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-22 02:28:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 208 transitions. [2022-11-22 02:28:45,376 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 208 transitions. Word has length 20 [2022-11-22 02:28:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:45,376 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 208 transitions. [2022-11-22 02:28:45,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-22 02:28:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 208 transitions. [2022-11-22 02:28:45,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:28:45,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:45,378 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] [2022-11-22 02:28:45,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 02:28:45,379 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 02:28:45,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:45,380 INFO L85 PathProgramCache]: Analyzing trace with hash -431579225, now seen corresponding path program 2 times [2022-11-22 02:28:45,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:45,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606162787] [2022-11-22 02:28:45,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:46,490 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-22 02:28:46,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:46,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606162787] [2022-11-22 02:28:46,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606162787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:46,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:46,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:28:46,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164990709] [2022-11-22 02:28:46,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:46,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:28:46,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:46,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:28:46,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:28:46,494 INFO L87 Difference]: Start difference. First operand 101 states and 208 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-22 02:28:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:46,814 INFO L93 Difference]: Finished difference Result 148 states and 296 transitions. [2022-11-22 02:28:46,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:28:46,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2022-11-22 02:28:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:46,816 INFO L225 Difference]: With dead ends: 148 [2022-11-22 02:28:46,816 INFO L226 Difference]: Without dead ends: 130 [2022-11-22 02:28:46,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:28:46,817 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 61 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:46,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 10 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:28:46,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-22 02:28:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2022-11-22 02:28:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 92 states have internal predecessors, (188), 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-22 02:28:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 188 transitions. [2022-11-22 02:28:46,822 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 188 transitions. Word has length 20 [2022-11-22 02:28:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:46,823 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 188 transitions. [2022-11-22 02:28:46,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-22 02:28:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 188 transitions. [2022-11-22 02:28:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:28:46,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:46,824 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] [2022-11-22 02:28:46,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 02:28:46,824 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 02:28:46,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1532625453, now seen corresponding path program 3 times [2022-11-22 02:28:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:46,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049325406] [2022-11-22 02:28:46,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:46,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 02:28:46,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 02:28:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 02:28:46,969 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 02:28:46,970 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 02:28:46,971 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-22 02:28:46,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-22 02:28:46,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-22 02:28:46,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-22 02:28:46,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-22 02:28:46,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-22 02:28:46,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 02:28:46,978 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:46,985 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 02:28:46,985 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:28:47,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:28:47 BasicIcfg [2022-11-22 02:28:47,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:28:47,055 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:28:47,055 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:28:47,056 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:28:47,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:28:32" (3/4) ... [2022-11-22 02:28:47,058 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-22 02:28:47,207 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 02:28:47,208 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:28:47,209 INFO L158 Benchmark]: Toolchain (without parser) took 16884.80ms. Allocated memory was 165.7MB in the beginning and 302.0MB in the end (delta: 136.3MB). Free memory was 134.2MB in the beginning and 111.3MB in the end (delta: 22.9MB). Peak memory consumption was 161.4MB. Max. memory is 16.1GB. [2022-11-22 02:28:47,209 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:28:47,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 754.64ms. Allocated memory is still 165.7MB. Free memory was 134.2MB in the beginning and 111.9MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-22 02:28:47,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.12ms. Allocated memory is still 165.7MB. Free memory was 111.9MB in the beginning and 109.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:28:47,211 INFO L158 Benchmark]: Boogie Preprocessor took 46.98ms. Allocated memory is still 165.7MB. Free memory was 109.2MB in the beginning and 107.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:28:47,212 INFO L158 Benchmark]: RCFGBuilder took 984.41ms. Allocated memory is still 165.7MB. Free memory was 107.1MB in the beginning and 74.8MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-22 02:28:47,212 INFO L158 Benchmark]: TraceAbstraction took 14824.49ms. Allocated memory was 165.7MB in the beginning and 302.0MB in the end (delta: 136.3MB). Free memory was 74.2MB in the beginning and 121.8MB in the end (delta: -47.6MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. [2022-11-22 02:28:47,213 INFO L158 Benchmark]: Witness Printer took 152.74ms. Allocated memory is still 302.0MB. Free memory was 120.7MB in the beginning and 111.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-22 02:28:47,216 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.32ms. Allocated memory is still 117.4MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 754.64ms. Allocated memory is still 165.7MB. Free memory was 134.2MB in the beginning and 111.9MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.12ms. Allocated memory is still 165.7MB. Free memory was 111.9MB in the beginning and 109.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.98ms. Allocated memory is still 165.7MB. Free memory was 109.2MB in the beginning and 107.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 984.41ms. Allocated memory is still 165.7MB. Free memory was 107.1MB in the beginning and 74.8MB in the end (delta: 32.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14824.49ms. Allocated memory was 165.7MB in the beginning and 302.0MB in the end (delta: 136.3MB). Free memory was 74.2MB in the beginning and 121.8MB in the end (delta: -47.6MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. * Witness Printer took 152.74ms. Allocated memory is still 302.0MB. Free memory was 120.7MB in the beginning and 111.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 122 PlacesBefore, 35 PlacesAfterwards, 114 TransitionsBefore, 26 TransitionsAfterwards, 1958 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 4811 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2465, independent: 2303, independent conditional: 0, independent unconditional: 2303, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1449, independent: 1397, independent conditional: 0, independent unconditional: 1397, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1449, independent: 1373, independent conditional: 0, independent unconditional: 1373, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 530, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 459, dependent conditional: 0, dependent unconditional: 459, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2465, independent: 906, independent conditional: 0, independent unconditional: 906, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 1449, unknown conditional: 0, unknown unconditional: 1449] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 92, Positive conditional cache size: 0, Positive unconditional cache size: 92, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=-3, t1828={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=-2, t1828={5:0}, t1829={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=-1, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L744] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: 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: 834]: 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: 832]: 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: 830]: 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, 140 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 337 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 888 IncrementalHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 32 mSDtfsCounter, 888 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=584occurred in iteration=2, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 430 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 1079 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-22 02:28:47,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94af8c3c-c7de-497f-9fdf-aefb7ec00129/bin/utaipan-g80aRyZoba/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