./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix005.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta --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 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5 --- 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-dbf71c6-m [2022-10-17 17:42:48,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 17:42:48,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 17:42:48,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 17:42:48,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 17:42:48,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 17:42:48,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 17:42:48,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 17:42:48,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 17:42:48,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 17:42:48,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 17:42:48,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 17:42:48,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 17:42:48,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 17:42:48,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 17:42:48,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 17:42:48,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 17:42:48,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 17:42:48,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 17:42:48,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 17:42:48,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 17:42:48,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 17:42:48,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 17:42:48,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 17:42:48,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 17:42:48,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 17:42:48,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 17:42:48,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 17:42:48,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 17:42:48,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 17:42:48,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 17:42:48,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 17:42:48,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 17:42:48,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 17:42:48,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 17:42:48,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 17:42:48,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 17:42:48,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 17:42:48,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 17:42:48,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 17:42:48,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 17:42:48,253 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-10-17 17:42:48,302 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 17:42:48,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 17:42:48,303 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 17:42:48,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 17:42:48,305 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 17:42:48,305 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 17:42:48,305 INFO L138 SettingsManager]: * User list type=DISABLED [2022-10-17 17:42:48,306 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-10-17 17:42:48,306 INFO L138 SettingsManager]: * Explicit value domain=true [2022-10-17 17:42:48,306 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-10-17 17:42:48,308 INFO L138 SettingsManager]: * Octagon Domain=false [2022-10-17 17:42:48,308 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-10-17 17:42:48,308 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-10-17 17:42:48,309 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-10-17 17:42:48,309 INFO L138 SettingsManager]: * Interval Domain=false [2022-10-17 17:42:48,309 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-10-17 17:42:48,309 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-10-17 17:42:48,310 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-10-17 17:42:48,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 17:42:48,311 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 17:42:48,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 17:42:48,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 17:42:48,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 17:42:48,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 17:42:48,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 17:42:48,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 17:42:48,315 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 17:42:48,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 17:42:48,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 17:42:48,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 17:42:48,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 17:42:48,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 17:42:48,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 17:42:48,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 17:42:48,317 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-10-17 17:42:48,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 17:42:48,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 17:42:48,318 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-10-17 17:42:48,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 17:42:48,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 17:42:48,319 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-10-17 17:42:48,319 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_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/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_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta 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 -> 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5 [2022-10-17 17:42:48,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 17:42:48,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 17:42:48,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 17:42:48,682 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 17:42:48,683 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 17:42:48,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/../../sv-benchmarks/c/pthread-wmm/mix005.opt.i [2022-10-17 17:42:48,772 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/data/1005757f4/89201bfac51a42c7bcad1d1fd0720a10/FLAG9d5fe3df8 [2022-10-17 17:42:49,433 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 17:42:49,434 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/sv-benchmarks/c/pthread-wmm/mix005.opt.i [2022-10-17 17:42:49,454 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/data/1005757f4/89201bfac51a42c7bcad1d1fd0720a10/FLAG9d5fe3df8 [2022-10-17 17:42:49,699 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/data/1005757f4/89201bfac51a42c7bcad1d1fd0720a10 [2022-10-17 17:42:49,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 17:42:49,708 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 17:42:49,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 17:42:49,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 17:42:49,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 17:42:49,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:42:49" (1/1) ... [2022-10-17 17:42:49,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3411ddb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:49, skipping insertion in model container [2022-10-17 17:42:49,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:42:49" (1/1) ... [2022-10-17 17:42:49,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 17:42:49,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 17:42:49,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/sv-benchmarks/c/pthread-wmm/mix005.opt.i[944,957] [2022-10-17 17:42:50,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 17:42:50,390 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 17:42:50,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/sv-benchmarks/c/pthread-wmm/mix005.opt.i[944,957] [2022-10-17 17:42:50,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 17:42:50,639 INFO L208 MainTranslator]: Completed translation [2022-10-17 17:42:50,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:50 WrapperNode [2022-10-17 17:42:50,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 17:42:50,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 17:42:50,641 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 17:42:50,641 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 17:42:50,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:50" (1/1) ... [2022-10-17 17:42:50,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:50" (1/1) ... [2022-10-17 17:42:50,765 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 296 [2022-10-17 17:42:50,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 17:42:50,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 17:42:50,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 17:42:50,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 17:42:50,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:50" (1/1) ... [2022-10-17 17:42:50,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:50" (1/1) ... [2022-10-17 17:42:50,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:50" (1/1) ... [2022-10-17 17:42:50,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:50" (1/1) ... [2022-10-17 17:42:50,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:50" (1/1) ... [2022-10-17 17:42:50,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:50" (1/1) ... [2022-10-17 17:42:50,861 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:50" (1/1) ... [2022-10-17 17:42:50,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:50" (1/1) ... [2022-10-17 17:42:50,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 17:42:50,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 17:42:50,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 17:42:50,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 17:42:50,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:50" (1/1) ... [2022-10-17 17:42:50,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 17:42:50,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/z3 [2022-10-17 17:42:50,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 17:42:50,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 17:42:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 17:42:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 17:42:50,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 17:42:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 17:42:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 17:42:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-10-17 17:42:50,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-10-17 17:42:50,979 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-10-17 17:42:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-10-17 17:42:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-10-17 17:42:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-10-17 17:42:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-10-17 17:42:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-10-17 17:42:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 17:42:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 17:42:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 17:42:50,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 17:42:50,985 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 17:42:51,176 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 17:42:51,181 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 17:42:52,149 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 17:42:52,820 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 17:42:52,820 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 17:42:52,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:42:52 BoogieIcfgContainer [2022-10-17 17:42:52,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 17:42:52,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 17:42:52,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 17:42:52,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 17:42:52,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 05:42:49" (1/3) ... [2022-10-17 17:42:52,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cddf30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:42:52, skipping insertion in model container [2022-10-17 17:42:52,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:42:50" (2/3) ... [2022-10-17 17:42:52,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cddf30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:42:52, skipping insertion in model container [2022-10-17 17:42:52,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:42:52" (3/3) ... [2022-10-17 17:42:52,839 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005.opt.i [2022-10-17 17:42:52,852 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 17:42:52,865 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 17:42:52,865 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 17:42:52,865 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 17:42:53,020 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-17 17:42:53,091 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-10-17 17:42:53,115 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 294 flow [2022-10-17 17:42:53,126 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 294 flow [2022-10-17 17:42:53,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-10-17 17:42:53,247 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-10-17 17:42:53,247 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 17:42:53,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-10-17 17:42:53,259 INFO L118 LiptonReduction]: Number of co-enabled transitions 3060 [2022-10-17 17:43:02,098 INFO L133 LiptonReduction]: Checked pairs total: 7666 [2022-10-17 17:43:02,098 INFO L135 LiptonReduction]: Total number of compositions: 120 [2022-10-17 17:43:02,112 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2022-10-17 17:43:02,397 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2602 states, 2599 states have (on average 3.9030396306271644) internal successors, (10144), 2601 states have internal predecessors, (10144), 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-10-17 17:43:02,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 17:43:02,437 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;@ead897b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 17:43:02,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-10-17 17:43:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 2602 states, 2599 states have (on average 3.9030396306271644) internal successors, (10144), 2601 states have internal predecessors, (10144), 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-10-17 17:43:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-17 17:43:02,470 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:02,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:02,472 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:02,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:02,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1874806189, now seen corresponding path program 1 times [2022-10-17 17:43:02,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:02,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907428987] [2022-10-17 17:43:02,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:02,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:43:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:43:03,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:43:03,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907428987] [2022-10-17 17:43:03,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907428987] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:43:03,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:43:03,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-17 17:43:03,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834212940] [2022-10-17 17:43:03,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:43:03,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:43:03,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:43:03,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:43:03,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:43:03,375 INFO L87 Difference]: Start difference. First operand has 2602 states, 2599 states have (on average 3.9030396306271644) internal successors, (10144), 2601 states have internal predecessors, (10144), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:43:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:43:03,594 INFO L93 Difference]: Finished difference Result 2202 states and 8344 transitions. [2022-10-17 17:43:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:43:03,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-17 17:43:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:43:03,661 INFO L225 Difference]: With dead ends: 2202 [2022-10-17 17:43:03,662 INFO L226 Difference]: Without dead ends: 2122 [2022-10-17 17:43:03,663 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-10-17 17:43:03,669 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:43:03,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:43:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2022-10-17 17:43:03,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2022-10-17 17:43:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 2121 states have (on average 3.8095238095238093) internal successors, (8080), 2121 states have internal predecessors, (8080), 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-10-17 17:43:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2022-10-17 17:43:03,905 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2022-10-17 17:43:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:43:03,907 INFO L495 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2022-10-17 17:43:03,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:43:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2022-10-17 17:43:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-17 17:43:03,911 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:03,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:03,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 17:43:03,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:03,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:03,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2097570659, now seen corresponding path program 1 times [2022-10-17 17:43:03,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:03,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618802111] [2022-10-17 17:43:03,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:03,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:43:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:43:04,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:43:04,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618802111] [2022-10-17 17:43:04,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618802111] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:43:04,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:43:04,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-17 17:43:04,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320988216] [2022-10-17 17:43:04,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:43:04,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:43:04,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:43:04,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:43:04,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:43:04,241 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:43:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:43:04,541 INFO L93 Difference]: Finished difference Result 3118 states and 11366 transitions. [2022-10-17 17:43:04,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:43:04,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-17 17:43:04,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:43:04,633 INFO L225 Difference]: With dead ends: 3118 [2022-10-17 17:43:04,641 INFO L226 Difference]: Without dead ends: 3046 [2022-10-17 17:43:04,656 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-10-17 17:43:04,658 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:43:04,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:43:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2022-10-17 17:43:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 2814. [2022-10-17 17:43:04,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2814 states, 2813 states have (on average 3.719161038037682) internal successors, (10462), 2813 states have internal predecessors, (10462), 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-10-17 17:43:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 10462 transitions. [2022-10-17 17:43:04,880 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 10462 transitions. Word has length 11 [2022-10-17 17:43:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:43:04,880 INFO L495 AbstractCegarLoop]: Abstraction has 2814 states and 10462 transitions. [2022-10-17 17:43:04,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:43:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 10462 transitions. [2022-10-17 17:43:04,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-17 17:43:04,885 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:04,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:04,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 17:43:04,886 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:04,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:04,886 INFO L85 PathProgramCache]: Analyzing trace with hash -641050394, now seen corresponding path program 1 times [2022-10-17 17:43:04,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:04,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278647144] [2022-10-17 17:43:04,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:43:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:43:05,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:43:05,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278647144] [2022-10-17 17:43:05,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278647144] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:43:05,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:43:05,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:43:05,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661335103] [2022-10-17 17:43:05,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:43:05,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:43:05,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:43:05,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:43:05,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:43:05,142 INFO L87 Difference]: Start difference. First operand 2814 states and 10462 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-10-17 17:43:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:43:05,330 INFO L93 Difference]: Finished difference Result 2830 states and 10298 transitions. [2022-10-17 17:43:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 17:43:05,330 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-10-17 17:43:05,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:43:05,367 INFO L225 Difference]: With dead ends: 2830 [2022-10-17 17:43:05,367 INFO L226 Difference]: Without dead ends: 2830 [2022-10-17 17:43:05,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:43:05,372 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:43:05,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:43:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2022-10-17 17:43:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2370. [2022-10-17 17:43:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 2369 states have (on average 3.7214014352047275) internal successors, (8816), 2369 states have internal predecessors, (8816), 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-10-17 17:43:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 8816 transitions. [2022-10-17 17:43:05,665 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 8816 transitions. Word has length 12 [2022-10-17 17:43:05,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:43:05,667 INFO L495 AbstractCegarLoop]: Abstraction has 2370 states and 8816 transitions. [2022-10-17 17:43:05,668 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-10-17 17:43:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 8816 transitions. [2022-10-17 17:43:05,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-17 17:43:05,673 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:05,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:05,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 17:43:05,674 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:05,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:05,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1347595767, now seen corresponding path program 1 times [2022-10-17 17:43:05,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:05,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419701825] [2022-10-17 17:43:05,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:05,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:43:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:43:05,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:43:05,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419701825] [2022-10-17 17:43:05,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419701825] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:43:05,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:43:05,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:43:05,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579889944] [2022-10-17 17:43:05,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:43:05,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:43:05,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:43:05,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:43:05,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:43:05,978 INFO L87 Difference]: Start difference. First operand 2370 states and 8816 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-10-17 17:43:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:43:06,230 INFO L93 Difference]: Finished difference Result 2750 states and 9994 transitions. [2022-10-17 17:43:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 17:43:06,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-10-17 17:43:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:43:06,268 INFO L225 Difference]: With dead ends: 2750 [2022-10-17 17:43:06,268 INFO L226 Difference]: Without dead ends: 2750 [2022-10-17 17:43:06,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:43:06,272 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 40 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:43:06,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 5 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:43:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2022-10-17 17:43:06,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2330. [2022-10-17 17:43:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 2329 states have (on average 3.707170459424646) internal successors, (8634), 2329 states have internal predecessors, (8634), 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-10-17 17:43:06,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 8634 transitions. [2022-10-17 17:43:06,414 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 8634 transitions. Word has length 13 [2022-10-17 17:43:06,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:43:06,414 INFO L495 AbstractCegarLoop]: Abstraction has 2330 states and 8634 transitions. [2022-10-17 17:43:06,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-10-17 17:43:06,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 8634 transitions. [2022-10-17 17:43:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-17 17:43:06,419 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:06,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:06,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 17:43:06,420 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:06,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:06,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1947251014, now seen corresponding path program 1 times [2022-10-17 17:43:06,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:06,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743885975] [2022-10-17 17:43:06,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:06,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:43:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:43:06,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:43:06,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743885975] [2022-10-17 17:43:06,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743885975] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:43:06,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:43:06,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:43:06,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954679183] [2022-10-17 17:43:06,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:43:06,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:43:06,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:43:06,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:43:06,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:43:06,868 INFO L87 Difference]: Start difference. First operand 2330 states and 8634 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:43:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:43:07,075 INFO L93 Difference]: Finished difference Result 2482 states and 9008 transitions. [2022-10-17 17:43:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 17:43:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-17 17:43:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:43:07,112 INFO L225 Difference]: With dead ends: 2482 [2022-10-17 17:43:07,112 INFO L226 Difference]: Without dead ends: 2482 [2022-10-17 17:43:07,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:43:07,114 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:43:07,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 9 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:43:07,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2022-10-17 17:43:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2026. [2022-10-17 17:43:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 2025 states have (on average 3.6849382716049384) internal successors, (7462), 2025 states have internal predecessors, (7462), 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-10-17 17:43:07,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 7462 transitions. [2022-10-17 17:43:07,250 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 7462 transitions. Word has length 14 [2022-10-17 17:43:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:43:07,251 INFO L495 AbstractCegarLoop]: Abstraction has 2026 states and 7462 transitions. [2022-10-17 17:43:07,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:43:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 7462 transitions. [2022-10-17 17:43:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-17 17:43:07,258 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:07,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:07,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 17:43:07,260 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:07,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:07,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1289963776, now seen corresponding path program 1 times [2022-10-17 17:43:07,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:07,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782085182] [2022-10-17 17:43:07,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:07,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:43:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:43:07,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:43:07,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782085182] [2022-10-17 17:43:07,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782085182] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:43:07,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:43:07,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 17:43:07,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527592733] [2022-10-17 17:43:07,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:43:07,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:43:07,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:43:07,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:43:07,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:43:07,668 INFO L87 Difference]: Start difference. First operand 2026 states and 7462 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:43:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:43:07,859 INFO L93 Difference]: Finished difference Result 2144 states and 7188 transitions. [2022-10-17 17:43:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:43:07,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-17 17:43:07,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:43:07,874 INFO L225 Difference]: With dead ends: 2144 [2022-10-17 17:43:07,874 INFO L226 Difference]: Without dead ends: 1592 [2022-10-17 17:43:07,875 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-10-17 17:43:07,876 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:43:07,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 20 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:43:07,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2022-10-17 17:43:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2022-10-17 17:43:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1591 states have (on average 3.3287240729101195) internal successors, (5296), 1591 states have internal predecessors, (5296), 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-10-17 17:43:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 5296 transitions. [2022-10-17 17:43:07,955 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 5296 transitions. Word has length 16 [2022-10-17 17:43:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:43:07,956 INFO L495 AbstractCegarLoop]: Abstraction has 1592 states and 5296 transitions. [2022-10-17 17:43:07,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:43:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 5296 transitions. [2022-10-17 17:43:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-17 17:43:07,962 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:07,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:07,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 17:43:07,962 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1012792524, now seen corresponding path program 1 times [2022-10-17 17:43:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:07,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789661922] [2022-10-17 17:43:07,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:07,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:43:08,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:43:08,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:43:08,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789661922] [2022-10-17 17:43:08,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789661922] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:43:08,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:43:08,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:43:08,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904024229] [2022-10-17 17:43:08,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:43:08,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:43:08,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:43:08,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:43:08,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:43:08,247 INFO L87 Difference]: Start difference. First operand 1592 states and 5296 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-10-17 17:43:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:43:08,364 INFO L93 Difference]: Finished difference Result 2154 states and 7010 transitions. [2022-10-17 17:43:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:43:08,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-10-17 17:43:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:43:08,384 INFO L225 Difference]: With dead ends: 2154 [2022-10-17 17:43:08,384 INFO L226 Difference]: Without dead ends: 1498 [2022-10-17 17:43:08,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:43:08,386 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:43:08,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 10 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:43:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2022-10-17 17:43:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1390. [2022-10-17 17:43:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 3.1979841612670987) internal successors, (4442), 1389 states have internal predecessors, (4442), 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-10-17 17:43:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 4442 transitions. [2022-10-17 17:43:08,456 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 4442 transitions. Word has length 18 [2022-10-17 17:43:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:43:08,456 INFO L495 AbstractCegarLoop]: Abstraction has 1390 states and 4442 transitions. [2022-10-17 17:43:08,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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-10-17 17:43:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 4442 transitions. [2022-10-17 17:43:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-17 17:43:08,465 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:08,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:08,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 17:43:08,466 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:08,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:08,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1362392489, now seen corresponding path program 1 times [2022-10-17 17:43:08,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:08,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467346885] [2022-10-17 17:43:08,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:08,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:43:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:43:08,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:43:08,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467346885] [2022-10-17 17:43:08,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467346885] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:43:08,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:43:08,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 17:43:08,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122571095] [2022-10-17 17:43:08,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:43:08,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:43:08,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:43:08,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:43:08,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:43:08,900 INFO L87 Difference]: Start difference. First operand 1390 states and 4442 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:43:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:43:09,131 INFO L93 Difference]: Finished difference Result 1228 states and 3605 transitions. [2022-10-17 17:43:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 17:43:09,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-10-17 17:43:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:43:09,137 INFO L225 Difference]: With dead ends: 1228 [2022-10-17 17:43:09,137 INFO L226 Difference]: Without dead ends: 928 [2022-10-17 17:43:09,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-17 17:43:09,138 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 55 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:43:09,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 28 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:43:09,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-10-17 17:43:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2022-10-17 17:43:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 2.8802588996763756) internal successors, (2670), 927 states have internal predecessors, (2670), 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-10-17 17:43:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 2670 transitions. [2022-10-17 17:43:09,179 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 2670 transitions. Word has length 18 [2022-10-17 17:43:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:43:09,180 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 2670 transitions. [2022-10-17 17:43:09,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:43:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 2670 transitions. [2022-10-17 17:43:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-17 17:43:09,184 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:09,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:09,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 17:43:09,185 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:09,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:09,186 INFO L85 PathProgramCache]: Analyzing trace with hash 643928444, now seen corresponding path program 1 times [2022-10-17 17:43:09,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:09,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777529913] [2022-10-17 17:43:09,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:09,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:43:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:43:09,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:43:09,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777529913] [2022-10-17 17:43:09,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777529913] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:43:09,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:43:09,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 17:43:09,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546492662] [2022-10-17 17:43:09,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:43:09,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 17:43:09,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:43:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 17:43:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-17 17:43:09,601 INFO L87 Difference]: Start difference. First operand 928 states and 2670 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:43:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:43:09,867 INFO L93 Difference]: Finished difference Result 824 states and 2335 transitions. [2022-10-17 17:43:09,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 17:43:09,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-17 17:43:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:43:09,871 INFO L225 Difference]: With dead ends: 824 [2022-10-17 17:43:09,872 INFO L226 Difference]: Without dead ends: 725 [2022-10-17 17:43:09,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:43:09,875 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 91 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:43:09,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 35 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:43:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-10-17 17:43:09,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2022-10-17 17:43:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 2.8770718232044197) internal successors, (2083), 724 states have internal predecessors, (2083), 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-10-17 17:43:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 2083 transitions. [2022-10-17 17:43:09,906 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 2083 transitions. Word has length 20 [2022-10-17 17:43:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:43:09,908 INFO L495 AbstractCegarLoop]: Abstraction has 725 states and 2083 transitions. [2022-10-17 17:43:09,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 17:43:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 2083 transitions. [2022-10-17 17:43:09,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-17 17:43:09,912 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:09,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:09,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 17:43:09,913 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1132221349, now seen corresponding path program 1 times [2022-10-17 17:43:09,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:09,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97864740] [2022-10-17 17:43:09,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:43:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:43:10,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:43:10,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97864740] [2022-10-17 17:43:10,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97864740] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:43:10,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:43:10,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 17:43:10,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964238870] [2022-10-17 17:43:10,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:43:10,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 17:43:10,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:43:10,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 17:43:10,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:43:10,462 INFO L87 Difference]: Start difference. First operand 725 states and 2083 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-10-17 17:43:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:43:10,701 INFO L93 Difference]: Finished difference Result 701 states and 2034 transitions. [2022-10-17 17:43:10,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-17 17:43:10,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 23 [2022-10-17 17:43:10,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:43:10,704 INFO L225 Difference]: With dead ends: 701 [2022-10-17 17:43:10,704 INFO L226 Difference]: Without dead ends: 433 [2022-10-17 17:43:10,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-10-17 17:43:10,705 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 113 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:43:10,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 25 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:43:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-10-17 17:43:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2022-10-17 17:43:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 2.8078703703703702) internal successors, (1213), 432 states have internal predecessors, (1213), 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-10-17 17:43:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1213 transitions. [2022-10-17 17:43:10,724 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1213 transitions. Word has length 23 [2022-10-17 17:43:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:43:10,725 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 1213 transitions. [2022-10-17 17:43:10,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-10-17 17:43:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1213 transitions. [2022-10-17 17:43:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-17 17:43:10,728 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:10,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:10,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-17 17:43:10,728 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:10,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:10,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1881052050, now seen corresponding path program 1 times [2022-10-17 17:43:10,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:10,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081313924] [2022-10-17 17:43:10,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:43:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:43:11,113 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:43:11,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081313924] [2022-10-17 17:43:11,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081313924] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:43:11,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:43:11,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 17:43:11,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121067757] [2022-10-17 17:43:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:43:11,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:43:11,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:43:11,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:43:11,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:43:11,116 INFO L87 Difference]: Start difference. First operand 433 states and 1213 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-10-17 17:43:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:43:11,255 INFO L93 Difference]: Finished difference Result 570 states and 1578 transitions. [2022-10-17 17:43:11,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 17:43:11,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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) Word has length 26 [2022-10-17 17:43:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:43:11,257 INFO L225 Difference]: With dead ends: 570 [2022-10-17 17:43:11,257 INFO L226 Difference]: Without dead ends: 184 [2022-10-17 17:43:11,257 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-10-17 17:43:11,258 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:43:11,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 13 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:43:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-10-17 17:43:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-10-17 17:43:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.480874316939891) internal successors, (454), 183 states have internal predecessors, (454), 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-10-17 17:43:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 454 transitions. [2022-10-17 17:43:11,266 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 454 transitions. Word has length 26 [2022-10-17 17:43:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:43:11,266 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 454 transitions. [2022-10-17 17:43:11,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-10-17 17:43:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 454 transitions. [2022-10-17 17:43:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-17 17:43:11,268 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:11,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:11,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-17 17:43:11,269 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:11,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:11,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2074719096, now seen corresponding path program 2 times [2022-10-17 17:43:11,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:11,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920784411] [2022-10-17 17:43:11,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:11,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:43:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:43:11,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:43:11,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920784411] [2022-10-17 17:43:11,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920784411] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:43:11,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:43:11,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 17:43:11,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737607748] [2022-10-17 17:43:11,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:43:11,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:43:11,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:43:11,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:43:11,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:43:11,647 INFO L87 Difference]: Start difference. First operand 184 states and 454 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-10-17 17:43:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:43:11,774 INFO L93 Difference]: Finished difference Result 234 states and 572 transitions. [2022-10-17 17:43:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 17:43:11,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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) Word has length 26 [2022-10-17 17:43:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:43:11,776 INFO L225 Difference]: With dead ends: 234 [2022-10-17 17:43:11,776 INFO L226 Difference]: Without dead ends: 92 [2022-10-17 17:43:11,777 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-10-17 17:43:11,777 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:43:11,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:43:11,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-10-17 17:43:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-10-17 17:43:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.1758241758241756) internal successors, (198), 91 states have internal predecessors, (198), 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-10-17 17:43:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 198 transitions. [2022-10-17 17:43:11,783 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 198 transitions. Word has length 26 [2022-10-17 17:43:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:43:11,783 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 198 transitions. [2022-10-17 17:43:11,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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-10-17 17:43:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 198 transitions. [2022-10-17 17:43:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-17 17:43:11,785 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:11,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:11,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-17 17:43:11,786 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:11,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:11,787 INFO L85 PathProgramCache]: Analyzing trace with hash -2145757614, now seen corresponding path program 3 times [2022-10-17 17:43:11,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:11,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024448273] [2022-10-17 17:43:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:11,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:43:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:43:14,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:43:14,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024448273] [2022-10-17 17:43:14,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024448273] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:43:14,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:43:14,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 17:43:14,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613328170] [2022-10-17 17:43:14,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:43:14,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 17:43:14,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:43:14,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 17:43:14,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:43:14,132 INFO L87 Difference]: Start difference. First operand 92 states and 198 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-10-17 17:43:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:43:14,348 INFO L93 Difference]: Finished difference Result 110 states and 232 transitions. [2022-10-17 17:43:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-17 17:43:14,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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) Word has length 26 [2022-10-17 17:43:14,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:43:14,349 INFO L225 Difference]: With dead ends: 110 [2022-10-17 17:43:14,349 INFO L226 Difference]: Without dead ends: 56 [2022-10-17 17:43:14,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-17 17:43:14,351 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:43:14,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 32 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:43:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-17 17:43:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-10-17 17:43:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 55 states have internal predecessors, (98), 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-10-17 17:43:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 98 transitions. [2022-10-17 17:43:14,355 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 98 transitions. Word has length 26 [2022-10-17 17:43:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:43:14,355 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 98 transitions. [2022-10-17 17:43:14,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-10-17 17:43:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 98 transitions. [2022-10-17 17:43:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-17 17:43:14,357 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:43:14,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:14,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-17 17:43:14,357 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-10-17 17:43:14,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:43:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2049834098, now seen corresponding path program 4 times [2022-10-17 17:43:14,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:43:14,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530282752] [2022-10-17 17:43:14,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:43:14,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:43:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 17:43:14,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 17:43:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 17:43:14,640 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-10-17 17:43:14,641 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 17:43:14,642 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-10-17 17:43:14,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-10-17 17:43:14,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-10-17 17:43:14,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-10-17 17:43:14,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-10-17 17:43:14,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-10-17 17:43:14,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-10-17 17:43:14,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-17 17:43:14,648 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:43:14,657 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-17 17:43:14,657 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 17:43:14,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 05:43:14 BasicIcfg [2022-10-17 17:43:14,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 17:43:14,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 17:43:14,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 17:43:14,831 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 17:43:14,836 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:42:52" (3/4) ... [2022-10-17 17:43:14,844 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 17:43:14,973 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/witness.graphml [2022-10-17 17:43:14,973 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 17:43:14,974 INFO L158 Benchmark]: Toolchain (without parser) took 25265.90ms. Allocated memory was 113.2MB in the beginning and 419.4MB in the end (delta: 306.2MB). Free memory was 80.0MB in the beginning and 144.7MB in the end (delta: -64.6MB). Peak memory consumption was 243.5MB. Max. memory is 16.1GB. [2022-10-17 17:43:14,974 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 81.8MB. Free memory was 50.6MB in the beginning and 50.5MB in the end (delta: 49.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 17:43:14,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 928.81ms. Allocated memory is still 113.2MB. Free memory was 79.9MB in the beginning and 87.2MB in the end (delta: -7.4MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2022-10-17 17:43:14,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.71ms. Allocated memory is still 113.2MB. Free memory was 87.2MB in the beginning and 84.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 17:43:14,975 INFO L158 Benchmark]: Boogie Preprocessor took 96.45ms. Allocated memory is still 113.2MB. Free memory was 84.3MB in the beginning and 81.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 17:43:14,976 INFO L158 Benchmark]: RCFGBuilder took 1951.49ms. Allocated memory was 113.2MB in the beginning and 161.5MB in the end (delta: 48.2MB). Free memory was 81.4MB in the beginning and 116.5MB in the end (delta: -35.1MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2022-10-17 17:43:14,976 INFO L158 Benchmark]: TraceAbstraction took 22002.93ms. Allocated memory was 161.5MB in the beginning and 419.4MB in the end (delta: 257.9MB). Free memory was 115.4MB in the beginning and 167.7MB in the end (delta: -52.3MB). Peak memory consumption was 204.6MB. Max. memory is 16.1GB. [2022-10-17 17:43:14,979 INFO L158 Benchmark]: Witness Printer took 142.66ms. Allocated memory is still 419.4MB. Free memory was 167.7MB in the beginning and 144.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-10-17 17:43:14,982 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.26ms. Allocated memory is still 81.8MB. Free memory was 50.6MB in the beginning and 50.5MB in the end (delta: 49.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 928.81ms. Allocated memory is still 113.2MB. Free memory was 79.9MB in the beginning and 87.2MB in the end (delta: -7.4MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 132.71ms. Allocated memory is still 113.2MB. Free memory was 87.2MB in the beginning and 84.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.45ms. Allocated memory is still 113.2MB. Free memory was 84.3MB in the beginning and 81.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1951.49ms. Allocated memory was 113.2MB in the beginning and 161.5MB in the end (delta: 48.2MB). Free memory was 81.4MB in the beginning and 116.5MB in the end (delta: -35.1MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22002.93ms. Allocated memory was 161.5MB in the beginning and 419.4MB in the end (delta: 257.9MB). Free memory was 115.4MB in the beginning and 167.7MB in the end (delta: -52.3MB). Peak memory consumption was 204.6MB. Max. memory is 16.1GB. * Witness Printer took 142.66ms. Allocated memory is still 419.4MB. Free memory was 167.7MB in the beginning and 144.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 148 PlacesBefore, 45 PlacesAfterwards, 137 TransitionsBefore, 33 TransitionsAfterwards, 3060 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 7666 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3981, positive: 3779, positive conditional: 0, positive unconditional: 3779, negative: 202, negative conditional: 0, negative unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2064, positive: 2003, positive conditional: 0, positive unconditional: 2003, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2064, positive: 1973, positive conditional: 0, positive unconditional: 1973, negative: 91, negative conditional: 0, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 91, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 816, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 727, negative conditional: 0, negative unconditional: 727, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3981, positive: 1776, positive conditional: 0, positive unconditional: 1776, negative: 141, negative conditional: 0, negative unconditional: 141, unknown: 2064, unknown conditional: 0, unknown unconditional: 2064] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 196, Positive conditional cache size: 0, Positive unconditional cache size: 196, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t125; [L870] FCALL, FORK 0 pthread_create(&t125, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t125, ((void *)0), P0, ((void *)0))=8, t125={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t126; [L872] FCALL, FORK 0 pthread_create(&t126, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t126, ((void *)0), P1, ((void *)0))=9, t125={5:0}, t126={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t127; [L874] FCALL, FORK 0 pthread_create(&t127, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t127, ((void *)0), P2, ((void *)0))=10, t125={5:0}, t126={6:0}, t127={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t128; [L876] FCALL, FORK 0 pthread_create(&t128, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t128, ((void *)0), P3, ((void *)0))=11, t125={5:0}, t126={6:0}, t127={7:0}, t128={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L832] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L795] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L796] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L797] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L798] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L799] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L847] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L882] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L882] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 874]: 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: 872]: 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: 870]: 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 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 463 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 671 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1138 IncrementalHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 82 mSDtfsCounter, 1138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2814occurred in iteration=2, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 1676 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-10-17 17:43:15,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d13339d5-9163-4bed-86ab-c8bd09c50618/bin/utaipan-G1rejxKTta/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