./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9 --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 ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 --- 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-6b4ec56 [2022-11-20 18:54:52,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 18:54:52,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 18:54:52,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 18:54:52,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 18:54:52,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 18:54:52,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 18:54:52,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 18:54:52,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 18:54:52,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 18:54:52,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 18:54:52,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 18:54:52,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 18:54:52,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 18:54:52,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 18:54:52,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 18:54:52,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 18:54:52,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 18:54:52,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 18:54:52,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 18:54:52,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 18:54:52,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 18:54:52,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 18:54:52,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 18:54:52,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 18:54:52,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 18:54:52,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 18:54:52,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 18:54:52,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 18:54:52,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 18:54:52,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 18:54:52,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 18:54:52,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 18:54:52,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 18:54:52,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 18:54:52,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 18:54:52,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 18:54:52,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 18:54:52,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 18:54:52,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 18:54:52,189 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 18:54:52,196 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 18:54:52,249 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 18:54:52,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 18:54:52,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 18:54:52,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 18:54:52,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 18:54:52,253 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 18:54:52,253 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 18:54:52,253 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 18:54:52,254 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 18:54:52,254 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 18:54:52,255 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 18:54:52,256 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 18:54:52,256 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 18:54:52,256 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 18:54:52,256 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 18:54:52,257 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 18:54:52,257 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 18:54:52,257 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 18:54:52,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 18:54:52,258 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 18:54:52,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 18:54:52,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 18:54:52,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 18:54:52,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 18:54:52,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 18:54:52,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 18:54:52,260 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 18:54:52,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 18:54:52,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 18:54:52,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 18:54:52,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 18:54:52,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 18:54:52,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 18:54:52,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 18:54:52,263 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 18:54:52,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 18:54:52,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 18:54:52,263 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 18:54:52,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 18:54:52,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 18:54:52,264 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 18:54:52,264 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_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/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_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9 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 -> ed015c7abb1e633204d95cacfb8444fc40c913627602030095cae55094cd4434 [2022-11-20 18:54:52,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 18:54:52,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 18:54:52,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 18:54:52,569 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 18:54:52,569 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 18:54:52,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-20 18:54:55,726 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 18:54:55,993 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 18:54:55,994 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-20 18:54:56,008 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/data/ed7875d16/cb1b9b35b7e743b59aa482c000ae5f64/FLAG98ce8070f [2022-11-20 18:54:56,023 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/data/ed7875d16/cb1b9b35b7e743b59aa482c000ae5f64 [2022-11-20 18:54:56,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 18:54:56,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 18:54:56,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 18:54:56,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 18:54:56,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 18:54:56,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:54:56" (1/1) ... [2022-11-20 18:54:56,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71255ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56, skipping insertion in model container [2022-11-20 18:54:56,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:54:56" (1/1) ... [2022-11-20 18:54:56,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 18:54:56,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 18:54:56,325 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_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-20 18:54:56,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 18:54:56,553 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 18:54:56,566 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_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/sv-benchmarks/c/pthread-wmm/rfi000_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-20 18:54:56,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 18:54:56,654 INFO L208 MainTranslator]: Completed translation [2022-11-20 18:54:56,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56 WrapperNode [2022-11-20 18:54:56,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 18:54:56,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 18:54:56,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 18:54:56,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 18:54:56,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56" (1/1) ... [2022-11-20 18:54:56,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56" (1/1) ... [2022-11-20 18:54:56,750 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2022-11-20 18:54:56,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 18:54:56,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 18:54:56,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 18:54:56,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 18:54:56,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56" (1/1) ... [2022-11-20 18:54:56,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56" (1/1) ... [2022-11-20 18:54:56,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56" (1/1) ... [2022-11-20 18:54:56,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56" (1/1) ... [2022-11-20 18:54:56,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56" (1/1) ... [2022-11-20 18:54:56,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56" (1/1) ... [2022-11-20 18:54:56,787 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56" (1/1) ... [2022-11-20 18:54:56,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56" (1/1) ... [2022-11-20 18:54:56,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 18:54:56,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 18:54:56,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 18:54:56,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 18:54:56,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56" (1/1) ... [2022-11-20 18:54:56,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 18:54:56,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 18:54:56,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 18:54:56,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 18:54:56,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 18:54:56,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 18:54:56,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 18:54:56,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 18:54:56,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 18:54:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 18:54:56,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 18:54:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 18:54:56,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 18:54:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 18:54:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 18:54:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 18:54:56,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 18:54:56,895 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 18:54:57,062 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 18:54:57,064 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 18:54:57,487 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 18:54:57,634 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 18:54:57,634 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 18:54:57,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:54:57 BoogieIcfgContainer [2022-11-20 18:54:57,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 18:54:57,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 18:54:57,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 18:54:57,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 18:54:57,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:54:56" (1/3) ... [2022-11-20 18:54:57,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213c0c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:54:57, skipping insertion in model container [2022-11-20 18:54:57,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:54:56" (2/3) ... [2022-11-20 18:54:57,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213c0c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:54:57, skipping insertion in model container [2022-11-20 18:54:57,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:54:57" (3/3) ... [2022-11-20 18:54:57,650 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt_pso.opt_rmo.opt.i [2022-11-20 18:54:57,659 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 18:54:57,671 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 18:54:57,671 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 18:54:57,671 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 18:54:57,757 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 18:54:57,830 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 18:54:57,844 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 97 transitions, 204 flow [2022-11-20 18:54:57,846 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 97 transitions, 204 flow [2022-11-20 18:54:57,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 97 transitions, 204 flow [2022-11-20 18:54:57,900 INFO L130 PetriNetUnfolder]: 2/95 cut-off events. [2022-11-20 18:54:57,907 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 18:54:57,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-11-20 18:54:57,918 INFO L119 LiptonReduction]: Number of co-enabled transitions 1292 [2022-11-20 18:55:02,753 INFO L134 LiptonReduction]: Checked pairs total: 3548 [2022-11-20 18:55:02,753 INFO L136 LiptonReduction]: Total number of compositions: 88 [2022-11-20 18:55:02,762 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 23 transitions, 56 flow [2022-11-20 18:55:02,801 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 222 states, 219 states have (on average 2.6392694063926943) internal successors, (578), 221 states have internal predecessors, (578), 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-20 18:55:02,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 18:55:02,830 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;@61e03ed3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 18:55:02,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-20 18:55:02,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 219 states have (on average 2.6392694063926943) internal successors, (578), 221 states have internal predecessors, (578), 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-20 18:55:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 18:55:02,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:55:02,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 18:55:02,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 18:55:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:55:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash 412418526, now seen corresponding path program 1 times [2022-11-20 18:55:02,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:55:02,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827688360] [2022-11-20 18:55:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:55:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:55:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:55:03,376 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-20 18:55:03,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:55:03,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827688360] [2022-11-20 18:55:03,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827688360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:55:03,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:55:03,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 18:55:03,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235659582] [2022-11-20 18:55:03,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:55:03,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 18:55:03,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:55:03,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 18:55:03,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 18:55:03,431 INFO L87 Difference]: Start difference. First operand has 222 states, 219 states have (on average 2.6392694063926943) internal successors, (578), 221 states have internal predecessors, (578), 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-20 18:55:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:55:03,548 INFO L93 Difference]: Finished difference Result 192 states and 459 transitions. [2022-11-20 18:55:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 18:55:03,550 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-20 18:55:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:55:03,560 INFO L225 Difference]: With dead ends: 192 [2022-11-20 18:55:03,563 INFO L226 Difference]: Without dead ends: 187 [2022-11-20 18:55:03,565 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-20 18:55:03,571 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:55:03,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:55:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-20 18:55:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-11-20 18:55:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 2.4193548387096775) internal successors, (450), 186 states have internal predecessors, (450), 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-20 18:55:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 450 transitions. [2022-11-20 18:55:03,648 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 450 transitions. Word has length 5 [2022-11-20 18:55:03,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:55:03,649 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 450 transitions. [2022-11-20 18:55:03,650 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-20 18:55:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 450 transitions. [2022-11-20 18:55:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 18:55:03,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:55:03,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:55:03,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 18:55:03,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 18:55:03,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:55:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1539622121, now seen corresponding path program 1 times [2022-11-20 18:55:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:55:03,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451157221] [2022-11-20 18:55:03,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:55:03,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:55:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:55:03,994 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-20 18:55:03,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:55:03,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451157221] [2022-11-20 18:55:03,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451157221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:55:03,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:55:03,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 18:55:03,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116613706] [2022-11-20 18:55:03,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:55:03,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 18:55:03,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:55:03,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 18:55:04,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 18:55:04,005 INFO L87 Difference]: Start difference. First operand 187 states and 450 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-20 18:55:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:55:04,128 INFO L93 Difference]: Finished difference Result 218 states and 498 transitions. [2022-11-20 18:55:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 18:55:04,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-11-20 18:55:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:55:04,135 INFO L225 Difference]: With dead ends: 218 [2022-11-20 18:55:04,135 INFO L226 Difference]: Without dead ends: 183 [2022-11-20 18:55:04,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-20 18:55:04,136 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:55:04,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 14 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:55:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-20 18:55:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-20 18:55:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.4065934065934065) internal successors, (438), 182 states have internal predecessors, (438), 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-20 18:55:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 438 transitions. [2022-11-20 18:55:04,147 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 438 transitions. Word has length 8 [2022-11-20 18:55:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:55:04,147 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 438 transitions. [2022-11-20 18:55:04,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-20 18:55:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 438 transitions. [2022-11-20 18:55:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 18:55:04,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:55:04,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:55:04,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 18:55:04,149 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 18:55:04,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:55:04,150 INFO L85 PathProgramCache]: Analyzing trace with hash 478269608, now seen corresponding path program 1 times [2022-11-20 18:55:04,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:55:04,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660427211] [2022-11-20 18:55:04,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:55:04,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:55:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:55:04,746 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-20 18:55:04,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:55:04,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660427211] [2022-11-20 18:55:04,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660427211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:55:04,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:55:04,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 18:55:04,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144578577] [2022-11-20 18:55:04,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:55:04,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 18:55:04,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:55:04,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 18:55:04,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 18:55:04,750 INFO L87 Difference]: Start difference. First operand 183 states and 438 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-20 18:55:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:55:05,048 INFO L93 Difference]: Finished difference Result 234 states and 542 transitions. [2022-11-20 18:55:05,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 18:55:05,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-20 18:55:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:55:05,052 INFO L225 Difference]: With dead ends: 234 [2022-11-20 18:55:05,052 INFO L226 Difference]: Without dead ends: 193 [2022-11-20 18:55:05,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 18:55:05,054 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 18:55:05,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 11 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 18:55:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-20 18:55:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 167. [2022-11-20 18:55:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.3132530120481927) internal successors, (384), 166 states have internal predecessors, (384), 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-20 18:55:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 384 transitions. [2022-11-20 18:55:05,074 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 384 transitions. Word has length 9 [2022-11-20 18:55:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:55:05,074 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 384 transitions. [2022-11-20 18:55:05,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-20 18:55:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 384 transitions. [2022-11-20 18:55:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 18:55:05,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:55:05,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:55:05,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 18:55:05,077 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 18:55:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:55:05,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1389770349, now seen corresponding path program 1 times [2022-11-20 18:55:05,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:55:05,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3600055] [2022-11-20 18:55:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:55:05,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:55:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:55:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 18:55:05,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:55:05,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3600055] [2022-11-20 18:55:05,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3600055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:55:05,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:55:05,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 18:55:05,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295140308] [2022-11-20 18:55:05,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:55:05,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 18:55:05,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:55:05,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 18:55:05,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 18:55:05,262 INFO L87 Difference]: Start difference. First operand 167 states and 384 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-20 18:55:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:55:05,370 INFO L93 Difference]: Finished difference Result 263 states and 584 transitions. [2022-11-20 18:55:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 18:55:05,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-20 18:55:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:55:05,371 INFO L225 Difference]: With dead ends: 263 [2022-11-20 18:55:05,371 INFO L226 Difference]: Without dead ends: 127 [2022-11-20 18:55:05,372 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-20 18:55:05,372 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:55:05,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 9 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:55:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-20 18:55:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-11-20 18:55:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.2419354838709675) internal successors, (278), 124 states have internal predecessors, (278), 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-20 18:55:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 278 transitions. [2022-11-20 18:55:05,379 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 278 transitions. Word has length 11 [2022-11-20 18:55:05,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:55:05,380 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 278 transitions. [2022-11-20 18:55:05,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-20 18:55:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 278 transitions. [2022-11-20 18:55:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 18:55:05,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:55:05,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:55:05,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 18:55:05,381 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 18:55:05,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:55:05,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1078057914, now seen corresponding path program 1 times [2022-11-20 18:55:05,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:55:05,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297915629] [2022-11-20 18:55:05,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:55:05,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:55:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:55:05,794 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-20 18:55:05,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:55:05,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297915629] [2022-11-20 18:55:05,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297915629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:55:05,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:55:05,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 18:55:05,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687907940] [2022-11-20 18:55:05,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:55:05,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 18:55:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:55:05,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 18:55:05,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 18:55:05,797 INFO L87 Difference]: Start difference. First operand 125 states and 278 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-20 18:55:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:55:06,264 INFO L93 Difference]: Finished difference Result 212 states and 475 transitions. [2022-11-20 18:55:06,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 18:55:06,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-20 18:55:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:55:06,266 INFO L225 Difference]: With dead ends: 212 [2022-11-20 18:55:06,266 INFO L226 Difference]: Without dead ends: 128 [2022-11-20 18:55:06,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-20 18:55:06,268 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 18:55:06,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 10 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 18:55:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-20 18:55:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 109. [2022-11-20 18:55:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.212962962962963) internal successors, (239), 108 states have internal predecessors, (239), 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-20 18:55:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 239 transitions. [2022-11-20 18:55:06,275 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 239 transitions. Word has length 12 [2022-11-20 18:55:06,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:55:06,276 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 239 transitions. [2022-11-20 18:55:06,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-20 18:55:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 239 transitions. [2022-11-20 18:55:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 18:55:06,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:55:06,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:55:06,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 18:55:06,280 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 18:55:06,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:55:06,283 INFO L85 PathProgramCache]: Analyzing trace with hash -168695436, now seen corresponding path program 2 times [2022-11-20 18:55:06,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:55:06,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393625470] [2022-11-20 18:55:06,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:55:06,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:55:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:55:06,553 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-20 18:55:06,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:55:06,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393625470] [2022-11-20 18:55:06,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393625470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:55:06,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:55:06,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 18:55:06,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968807994] [2022-11-20 18:55:06,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:55:06,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 18:55:06,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:55:06,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 18:55:06,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 18:55:06,558 INFO L87 Difference]: Start difference. First operand 109 states and 239 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-20 18:55:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:55:06,669 INFO L93 Difference]: Finished difference Result 117 states and 245 transitions. [2022-11-20 18:55:06,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 18:55:06,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-20 18:55:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:55:06,671 INFO L225 Difference]: With dead ends: 117 [2022-11-20 18:55:06,671 INFO L226 Difference]: Without dead ends: 101 [2022-11-20 18:55:06,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-20 18:55:06,672 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:55:06,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:55:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-20 18:55:06,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-20 18:55:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.17) internal successors, (217), 100 states have internal predecessors, (217), 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-20 18:55:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 217 transitions. [2022-11-20 18:55:06,678 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 217 transitions. Word has length 12 [2022-11-20 18:55:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:55:06,678 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 217 transitions. [2022-11-20 18:55:06,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-20 18:55:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 217 transitions. [2022-11-20 18:55:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 18:55:06,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:55:06,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:55:06,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 18:55:06,686 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 18:55:06,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:55:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1010713721, now seen corresponding path program 1 times [2022-11-20 18:55:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:55:06,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861264326] [2022-11-20 18:55:06,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:55:06,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:55:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:55:07,151 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-20 18:55:07,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:55:07,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861264326] [2022-11-20 18:55:07,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861264326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:55:07,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:55:07,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 18:55:07,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247355686] [2022-11-20 18:55:07,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:55:07,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 18:55:07,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:55:07,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 18:55:07,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 18:55:07,153 INFO L87 Difference]: Start difference. First operand 101 states and 217 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-20 18:55:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:55:07,363 INFO L93 Difference]: Finished difference Result 152 states and 326 transitions. [2022-11-20 18:55:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 18:55:07,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2022-11-20 18:55:07,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:55:07,364 INFO L225 Difference]: With dead ends: 152 [2022-11-20 18:55:07,364 INFO L226 Difference]: Without dead ends: 88 [2022-11-20 18:55:07,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 18:55:07,366 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 18:55:07,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 8 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 18:55:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-20 18:55:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-11-20 18:55:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 2.119047619047619) internal successors, (178), 84 states have internal predecessors, (178), 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-20 18:55:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 178 transitions. [2022-11-20 18:55:07,371 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 178 transitions. Word has length 13 [2022-11-20 18:55:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:55:07,371 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 178 transitions. [2022-11-20 18:55:07,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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-20 18:55:07,371 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 178 transitions. [2022-11-20 18:55:07,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 18:55:07,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:55:07,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:55:07,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 18:55:07,373 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 18:55:07,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:55:07,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2065205855, now seen corresponding path program 2 times [2022-11-20 18:55:07,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:55:07,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788859928] [2022-11-20 18:55:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:55:07,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:55:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:55:08,003 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-20 18:55:08,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:55:08,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788859928] [2022-11-20 18:55:08,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788859928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:55:08,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:55:08,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 18:55:08,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690721267] [2022-11-20 18:55:08,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:55:08,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 18:55:08,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:55:08,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 18:55:08,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 18:55:08,008 INFO L87 Difference]: Start difference. First operand 85 states and 178 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-20 18:55:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:55:08,185 INFO L93 Difference]: Finished difference Result 78 states and 151 transitions. [2022-11-20 18:55:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 18:55:08,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2022-11-20 18:55:08,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:55:08,186 INFO L225 Difference]: With dead ends: 78 [2022-11-20 18:55:08,186 INFO L226 Difference]: Without dead ends: 69 [2022-11-20 18:55:08,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-20 18:55:08,188 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:55:08,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 11 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:55:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-20 18:55:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-20 18:55:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 68 states have internal predecessors, (138), 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-20 18:55:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 138 transitions. [2022-11-20 18:55:08,192 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 138 transitions. Word has length 13 [2022-11-20 18:55:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:55:08,192 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 138 transitions. [2022-11-20 18:55:08,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-20 18:55:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 138 transitions. [2022-11-20 18:55:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 18:55:08,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:55:08,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:55:08,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 18:55:08,194 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 18:55:08,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:55:08,194 INFO L85 PathProgramCache]: Analyzing trace with hash -478326915, now seen corresponding path program 1 times [2022-11-20 18:55:08,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:55:08,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115709227] [2022-11-20 18:55:08,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:55:08,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:55:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:55:08,878 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-20 18:55:08,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:55:08,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115709227] [2022-11-20 18:55:08,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115709227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:55:08,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:55:08,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 18:55:08,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136446801] [2022-11-20 18:55:08,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:55:08,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 18:55:08,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:55:08,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 18:55:08,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 18:55:08,881 INFO L87 Difference]: Start difference. First operand 69 states and 138 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-20 18:55:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:55:09,066 INFO L93 Difference]: Finished difference Result 49 states and 78 transitions. [2022-11-20 18:55:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 18:55:09,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-20 18:55:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:55:09,068 INFO L225 Difference]: With dead ends: 49 [2022-11-20 18:55:09,068 INFO L226 Difference]: Without dead ends: 49 [2022-11-20 18:55:09,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 18:55:09,069 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:55:09,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:55:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-20 18:55:09,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-20 18:55:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.625) internal successors, (78), 48 states have internal predecessors, (78), 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-20 18:55:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2022-11-20 18:55:09,072 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 14 [2022-11-20 18:55:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:55:09,072 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 78 transitions. [2022-11-20 18:55:09,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-20 18:55:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 78 transitions. [2022-11-20 18:55:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 18:55:09,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:55:09,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 18:55:09,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 18:55:09,074 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 18:55:09,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:55:09,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1966714281, now seen corresponding path program 1 times [2022-11-20 18:55:09,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:55:09,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502146588] [2022-11-20 18:55:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:55:09,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:55:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:55:09,317 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-20 18:55:09,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:55:09,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502146588] [2022-11-20 18:55:09,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502146588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:55:09,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:55:09,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 18:55:09,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887340144] [2022-11-20 18:55:09,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:55:09,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 18:55:09,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:55:09,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 18:55:09,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 18:55:09,320 INFO L87 Difference]: Start difference. First operand 49 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:55:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:55:09,381 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-11-20 18:55:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 18:55:09,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 18:55:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:55:09,382 INFO L225 Difference]: With dead ends: 27 [2022-11-20 18:55:09,382 INFO L226 Difference]: Without dead ends: 27 [2022-11-20 18:55:09,382 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-20 18:55:09,383 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:55:09,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:55:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-20 18:55:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-20 18:55:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 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-20 18:55:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-20 18:55:09,385 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 15 [2022-11-20 18:55:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:55:09,385 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-20 18:55:09,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 18:55:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-20 18:55:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 18:55:09,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:55:09,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-20 18:55:09,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 18:55:09,386 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 18:55:09,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:55:09,387 INFO L85 PathProgramCache]: Analyzing trace with hash 638010520, now seen corresponding path program 1 times [2022-11-20 18:55:09,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:55:09,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060901860] [2022-11-20 18:55:09,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:55:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:55:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 18:55:10,141 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-20 18:55:10,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 18:55:10,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060901860] [2022-11-20 18:55:10,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060901860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 18:55:10,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 18:55:10,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 18:55:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536602542] [2022-11-20 18:55:10,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 18:55:10,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 18:55:10,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 18:55:10,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 18:55:10,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 18:55:10,144 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-20 18:55:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 18:55:10,329 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-11-20 18:55:10,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 18:55:10,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-20 18:55:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 18:55:10,331 INFO L225 Difference]: With dead ends: 36 [2022-11-20 18:55:10,331 INFO L226 Difference]: Without dead ends: 23 [2022-11-20 18:55:10,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-20 18:55:10,332 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 18:55:10,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 15 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 18:55:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-20 18:55:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-20 18:55:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 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-20 18:55:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-11-20 18:55:10,334 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2022-11-20 18:55:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 18:55:10,334 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-11-20 18:55:10,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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-20 18:55:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-11-20 18:55:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 18:55:10,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 18:55:10,335 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-20 18:55:10,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 18:55:10,335 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-20 18:55:10,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 18:55:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1036217634, now seen corresponding path program 2 times [2022-11-20 18:55:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 18:55:10,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499774835] [2022-11-20 18:55:10,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 18:55:10,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 18:55:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 18:55:10,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 18:55:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 18:55:10,511 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-20 18:55:10,511 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 18:55:10,513 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-20 18:55:10,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-20 18:55:10,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-20 18:55:10,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-20 18:55:10,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-20 18:55:10,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 18:55:10,519 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 18:55:10,525 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 18:55:10,525 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 18:55:10,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:55:10 BasicIcfg [2022-11-20 18:55:10,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 18:55:10,626 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 18:55:10,626 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 18:55:10,626 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 18:55:10,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:54:57" (3/4) ... [2022-11-20 18:55:10,629 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 18:55:10,730 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/witness.graphml [2022-11-20 18:55:10,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 18:55:10,731 INFO L158 Benchmark]: Toolchain (without parser) took 14703.13ms. Allocated memory was 159.4MB in the beginning and 245.4MB in the end (delta: 86.0MB). Free memory was 115.8MB in the beginning and 99.3MB in the end (delta: 16.5MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. [2022-11-20 18:55:10,731 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 159.4MB. Free memory was 102.7MB in the beginning and 102.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 18:55:10,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.41ms. Allocated memory is still 159.4MB. Free memory was 115.3MB in the beginning and 92.7MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 18:55:10,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.85ms. Allocated memory is still 159.4MB. Free memory was 92.7MB in the beginning and 89.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 18:55:10,732 INFO L158 Benchmark]: Boogie Preprocessor took 67.47ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 87.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 18:55:10,733 INFO L158 Benchmark]: RCFGBuilder took 818.61ms. Allocated memory is still 159.4MB. Free memory was 87.6MB in the beginning and 56.6MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-20 18:55:10,734 INFO L158 Benchmark]: TraceAbstraction took 12983.80ms. Allocated memory was 159.4MB in the beginning and 245.4MB in the end (delta: 86.0MB). Free memory was 56.1MB in the beginning and 107.7MB in the end (delta: -51.6MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2022-11-20 18:55:10,735 INFO L158 Benchmark]: Witness Printer took 104.56ms. Allocated memory is still 245.4MB. Free memory was 107.7MB in the beginning and 99.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 18:55:10,738 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.34ms. Allocated memory is still 159.4MB. Free memory was 102.7MB in the beginning and 102.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 625.41ms. Allocated memory is still 159.4MB. Free memory was 115.3MB in the beginning and 92.7MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.85ms. Allocated memory is still 159.4MB. Free memory was 92.7MB in the beginning and 89.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.47ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 87.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 818.61ms. Allocated memory is still 159.4MB. Free memory was 87.6MB in the beginning and 56.6MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12983.80ms. Allocated memory was 159.4MB in the beginning and 245.4MB in the end (delta: 86.0MB). Free memory was 56.1MB in the beginning and 107.7MB in the end (delta: -51.6MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * Witness Printer took 104.56ms. Allocated memory is still 245.4MB. Free memory was 107.7MB in the beginning and 99.3MB in the end (delta: 8.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: 4.9s, 102 PlacesBefore, 29 PlacesAfterwards, 97 TransitionsBefore, 23 TransitionsAfterwards, 1292 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, 3548 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2090, independent: 1954, independent conditional: 0, independent unconditional: 1954, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1055, independent: 1012, independent conditional: 0, independent unconditional: 1012, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1055, independent: 996, independent conditional: 0, independent unconditional: 996, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 454, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 394, dependent conditional: 0, dependent unconditional: 394, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2090, independent: 942, independent conditional: 0, independent unconditional: 942, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 1055, unknown conditional: 0, unknown unconditional: 1055] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587; [L801] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1587, ((void *)0), P0, ((void *)0))=-2, t1587={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L802] 0 pthread_t t1588; [L803] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1588, ((void *)0), P1, ((void *)0))=-1, t1587={5:0}, t1588={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=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 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) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L807] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L807] RET 0 assume_abort_if_not(main$tmp_guard0) [L809] 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) [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1587={5:0}, t1588={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L821] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L822] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L823] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L824] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L826] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 801]: 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: 803]: 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 5 procedures, 117 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 222 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 222 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 728 IncrementalHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 52 mSDtfsCounter, 728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 1242 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-20 18:55:10,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b6e03f2-a3ed-4cd0-b4dd-521a66543434/bin/utaipan-6cKwYrpEi9/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