./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS --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 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a --- 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-8393723 [2022-11-19 06:48:35,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:48:35,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:48:35,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:48:35,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:48:35,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:48:35,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:48:35,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:48:35,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:48:35,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:48:35,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:48:35,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:48:35,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:48:35,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:48:35,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:48:35,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:48:35,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:48:35,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:48:35,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:48:35,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:48:35,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:48:35,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:48:35,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:48:35,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:48:35,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:48:35,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:48:35,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:48:35,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:48:35,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:48:35,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:48:35,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:48:35,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:48:35,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:48:35,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:48:35,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:48:35,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:48:35,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:48:35,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:48:35,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:48:35,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:48:35,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:48:35,555 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 06:48:35,596 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:48:35,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:48:35,607 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:48:35,608 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:48:35,609 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:48:35,609 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:48:35,609 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:48:35,610 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:48:35,610 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:48:35,610 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:48:35,612 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:48:35,612 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:48:35,612 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:48:35,613 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:48:35,613 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:48:35,613 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:48:35,614 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:48:35,614 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:48:35,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:48:35,615 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 06:48:35,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:48:35,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 06:48:35,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:48:35,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 06:48:35,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:48:35,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 06:48:35,619 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 06:48:35,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 06:48:35,619 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:48:35,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 06:48:35,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:48:35,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:48:35,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:48:35,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:48:35,621 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:48:35,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:48:35,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 06:48:35,622 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:48:35,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:48:35,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 06:48:35,623 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:48:35,623 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/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_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS 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 -> 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a [2022-11-19 06:48:35,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:48:36,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:48:36,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:48:36,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:48:36,010 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:48:36,012 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 06:48:36,094 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/data/d93c1c872/08a57fc6582f4c57954ddf501d7b78e5/FLAG13cb3098b [2022-11-19 06:48:36,899 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:48:36,900 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 06:48:36,932 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/data/d93c1c872/08a57fc6582f4c57954ddf501d7b78e5/FLAG13cb3098b [2022-11-19 06:48:37,116 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/data/d93c1c872/08a57fc6582f4c57954ddf501d7b78e5 [2022-11-19 06:48:37,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:48:37,123 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:48:37,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:48:37,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:48:37,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:48:37,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:48:37" (1/1) ... [2022-11-19 06:48:37,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e04e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37, skipping insertion in model container [2022-11-19 06:48:37,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:48:37" (1/1) ... [2022-11-19 06:48:37,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:48:37,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:48:37,463 WARN L234 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_785311a5-b61b-4429-a905-37f92dea0ac1/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-19 06:48:37,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:48:37,728 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:48:37,749 WARN L234 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_785311a5-b61b-4429-a905-37f92dea0ac1/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-19 06:48:37,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:48:37,940 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:48:37,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37 WrapperNode [2022-11-19 06:48:37,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:48:37,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:48:37,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:48:37,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:48:37,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37" (1/1) ... [2022-11-19 06:48:38,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37" (1/1) ... [2022-11-19 06:48:38,051 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-19 06:48:38,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:48:38,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:48:38,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:48:38,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:48:38,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37" (1/1) ... [2022-11-19 06:48:38,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37" (1/1) ... [2022-11-19 06:48:38,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37" (1/1) ... [2022-11-19 06:48:38,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37" (1/1) ... [2022-11-19 06:48:38,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37" (1/1) ... [2022-11-19 06:48:38,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37" (1/1) ... [2022-11-19 06:48:38,123 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37" (1/1) ... [2022-11-19 06:48:38,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37" (1/1) ... [2022-11-19 06:48:38,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:48:38,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:48:38,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:48:38,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:48:38,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37" (1/1) ... [2022-11-19 06:48:38,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:48:38,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:48:38,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:48:38,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:48:38,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 06:48:38,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 06:48:38,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:48:38,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 06:48:38,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:48:38,240 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 06:48:38,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 06:48:38,240 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 06:48:38,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 06:48:38,240 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 06:48:38,241 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 06:48:38,241 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 06:48:38,241 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 06:48:38,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:48:38,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 06:48:38,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:48:38,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:48:38,243 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 06:48:38,464 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:48:38,467 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:48:38,945 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:48:39,154 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:48:39,154 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 06:48:39,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:48:39 BoogieIcfgContainer [2022-11-19 06:48:39,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:48:39,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:48:39,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:48:39,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:48:39,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:48:37" (1/3) ... [2022-11-19 06:48:39,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520d59e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:48:39, skipping insertion in model container [2022-11-19 06:48:39,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:48:37" (2/3) ... [2022-11-19 06:48:39,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520d59e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:48:39, skipping insertion in model container [2022-11-19 06:48:39,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:48:39" (3/3) ... [2022-11-19 06:48:39,173 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 06:48:39,183 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 06:48:39,196 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:48:39,196 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 06:48:39,196 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 06:48:39,341 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 06:48:39,412 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 06:48:39,433 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 296 flow [2022-11-19 06:48:39,436 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 296 flow [2022-11-19 06:48:39,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2022-11-19 06:48:39,500 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2022-11-19 06:48:39,500 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 06:48:39,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-11-19 06:48:39,510 INFO L119 LiptonReduction]: Number of co-enabled transitions 3404 [2022-11-19 06:48:46,512 INFO L134 LiptonReduction]: Checked pairs total: 9774 [2022-11-19 06:48:46,513 INFO L136 LiptonReduction]: Total number of compositions: 119 [2022-11-19 06:48:46,528 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2022-11-19 06:48:46,852 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4274 states, 4271 states have (on average 4.015921329899321) internal successors, (17152), 4273 states have internal predecessors, (17152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:46,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:48:46,886 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;@583f2533, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:48:46,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-19 06:48:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 4274 states, 4271 states have (on average 4.015921329899321) internal successors, (17152), 4273 states have internal predecessors, (17152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 06:48:46,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:46,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 06:48:46,915 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash 572087, now seen corresponding path program 1 times [2022-11-19 06:48:46,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:46,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333260645] [2022-11-19 06:48:46,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:46,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:48:47,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:47,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333260645] [2022-11-19 06:48:47,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333260645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:47,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:47,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 06:48:47,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239305422] [2022-11-19 06:48:47,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:47,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:48:47,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:47,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:48:47,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:48:47,522 INFO L87 Difference]: Start difference. First operand has 4274 states, 4271 states have (on average 4.015921329899321) internal successors, (17152), 4273 states have internal predecessors, (17152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:47,799 INFO L93 Difference]: Finished difference Result 3462 states and 13465 transitions. [2022-11-19 06:48:47,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:48:47,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 06:48:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:47,853 INFO L225 Difference]: With dead ends: 3462 [2022-11-19 06:48:47,854 INFO L226 Difference]: Without dead ends: 3312 [2022-11-19 06:48:47,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:48:47,858 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:47,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 8 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:48:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2022-11-19 06:48:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2022-11-19 06:48:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3312 states, 3311 states have (on average 3.9112050739957716) internal successors, (12950), 3311 states have internal predecessors, (12950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2022-11-19 06:48:48,132 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 3 [2022-11-19 06:48:48,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:48,133 INFO L495 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2022-11-19 06:48:48,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2022-11-19 06:48:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 06:48:48,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:48,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:48,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:48:48,140 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:48,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2124097200, now seen corresponding path program 1 times [2022-11-19 06:48:48,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:48,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108797786] [2022-11-19 06:48:48,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:48,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:48:48,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:48,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108797786] [2022-11-19 06:48:48,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108797786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:48,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:48,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 06:48:48,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252111766] [2022-11-19 06:48:48,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:48,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:48:48,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:48,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:48:48,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:48:48,629 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:48,848 INFO L93 Difference]: Finished difference Result 5206 states and 19638 transitions. [2022-11-19 06:48:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:48:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 06:48:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:48,892 INFO L225 Difference]: With dead ends: 5206 [2022-11-19 06:48:48,892 INFO L226 Difference]: Without dead ends: 4963 [2022-11-19 06:48:48,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:48:48,894 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:48,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 5 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:48:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4963 states. [2022-11-19 06:48:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4963 to 4525. [2022-11-19 06:48:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4525 states, 4524 states have (on average 3.84526967285588) internal successors, (17396), 4524 states have internal predecessors, (17396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4525 states to 4525 states and 17396 transitions. [2022-11-19 06:48:49,193 INFO L78 Accepts]: Start accepts. Automaton has 4525 states and 17396 transitions. Word has length 11 [2022-11-19 06:48:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:49,195 INFO L495 AbstractCegarLoop]: Abstraction has 4525 states and 17396 transitions. [2022-11-19 06:48:49,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:49,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4525 states and 17396 transitions. [2022-11-19 06:48:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 06:48:49,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:49,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:49,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 06:48:49,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:49,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:49,200 INFO L85 PathProgramCache]: Analyzing trace with hash -543046167, now seen corresponding path program 1 times [2022-11-19 06:48:49,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:49,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697956476] [2022-11-19 06:48:49,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:49,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:48:49,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:49,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697956476] [2022-11-19 06:48:49,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697956476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:49,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:49,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:48:49,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899065006] [2022-11-19 06:48:49,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:49,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:48:49,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:49,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:48:49,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:48:49,569 INFO L87 Difference]: Start difference. First operand 4525 states and 17396 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:49,845 INFO L93 Difference]: Finished difference Result 4595 states and 17297 transitions. [2022-11-19 06:48:49,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:48:49,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 06:48:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:49,889 INFO L225 Difference]: With dead ends: 4595 [2022-11-19 06:48:49,890 INFO L226 Difference]: Without dead ends: 4595 [2022-11-19 06:48:49,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:48:49,891 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 31 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 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-11-19 06:48:49,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 9 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:48:49,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2022-11-19 06:48:50,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 3719. [2022-11-19 06:48:50,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3719 states, 3718 states have (on average 3.839160839160839) internal successors, (14274), 3718 states have internal predecessors, (14274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 14274 transitions. [2022-11-19 06:48:50,136 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 14274 transitions. Word has length 12 [2022-11-19 06:48:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:50,137 INFO L495 AbstractCegarLoop]: Abstraction has 3719 states and 14274 transitions. [2022-11-19 06:48:50,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 14274 transitions. [2022-11-19 06:48:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 06:48:50,144 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:50,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:50,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 06:48:50,145 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:50,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1149525679, now seen corresponding path program 1 times [2022-11-19 06:48:50,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:50,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496663711] [2022-11-19 06:48:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:50,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:50,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:48:50,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:50,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496663711] [2022-11-19 06:48:50,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496663711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:50,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:50,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 06:48:50,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909732938] [2022-11-19 06:48:50,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:50,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:48:50,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:50,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:48:50,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:48:50,392 INFO L87 Difference]: Start difference. First operand 3719 states and 14274 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-11-19 06:48:50,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:50,617 INFO L93 Difference]: Finished difference Result 4495 states and 16922 transitions. [2022-11-19 06:48:50,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:48:50,618 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-11-19 06:48:50,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:50,717 INFO L225 Difference]: With dead ends: 4495 [2022-11-19 06:48:50,717 INFO L226 Difference]: Without dead ends: 4495 [2022-11-19 06:48:50,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:48:50,725 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:50,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 5 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:48:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2022-11-19 06:48:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 3679. [2022-11-19 06:48:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 3678 states have (on average 3.8314301250679716) internal successors, (14092), 3678 states have internal predecessors, (14092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 14092 transitions. [2022-11-19 06:48:50,883 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 14092 transitions. Word has length 13 [2022-11-19 06:48:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:50,883 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 14092 transitions. [2022-11-19 06:48:50,883 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-11-19 06:48:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 14092 transitions. [2022-11-19 06:48:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 06:48:50,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:50,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:50,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 06:48:50,890 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:50,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:50,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2117061546, now seen corresponding path program 1 times [2022-11-19 06:48:50,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:50,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144959198] [2022-11-19 06:48:50,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:50,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:51,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-11-19 06:48:51,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:51,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144959198] [2022-11-19 06:48:51,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144959198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:51,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:51,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:48:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344693083] [2022-11-19 06:48:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:51,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:48:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:51,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:48:51,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:48:51,240 INFO L87 Difference]: Start difference. First operand 3679 states and 14092 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:51,454 INFO L93 Difference]: Finished difference Result 3680 states and 12755 transitions. [2022-11-19 06:48:51,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:48:51,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 06:48:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:51,470 INFO L225 Difference]: With dead ends: 3680 [2022-11-19 06:48:51,470 INFO L226 Difference]: Without dead ends: 2711 [2022-11-19 06:48:51,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:51,472 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:51,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 20 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:48:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2022-11-19 06:48:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2711. [2022-11-19 06:48:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2710 states have (on average 3.4199261992619925) internal successors, (9268), 2710 states have internal predecessors, (9268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 9268 transitions. [2022-11-19 06:48:51,635 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 9268 transitions. Word has length 14 [2022-11-19 06:48:51,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:51,635 INFO L495 AbstractCegarLoop]: Abstraction has 2711 states and 9268 transitions. [2022-11-19 06:48:51,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 9268 transitions. [2022-11-19 06:48:51,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 06:48:51,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:51,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:51,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 06:48:51,640 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:51,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash 842370, now seen corresponding path program 1 times [2022-11-19 06:48:51,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:51,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250740969] [2022-11-19 06:48:51,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:51,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:48:51,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:51,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250740969] [2022-11-19 06:48:51,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250740969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:51,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:51,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:48:51,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412171572] [2022-11-19 06:48:51,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:51,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:48:51,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:51,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:48:51,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:51,911 INFO L87 Difference]: Start difference. First operand 2711 states and 9268 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:52,176 INFO L93 Difference]: Finished difference Result 2286 states and 7211 transitions. [2022-11-19 06:48:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:48:52,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2022-11-19 06:48:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:52,186 INFO L225 Difference]: With dead ends: 2286 [2022-11-19 06:48:52,187 INFO L226 Difference]: Without dead ends: 1717 [2022-11-19 06:48:52,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:48:52,188 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 76 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:52,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 28 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:48:52,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2022-11-19 06:48:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1705. [2022-11-19 06:48:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1704 states have (on average 3.0938967136150235) internal successors, (5272), 1704 states have internal predecessors, (5272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 5272 transitions. [2022-11-19 06:48:52,264 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 5272 transitions. Word has length 17 [2022-11-19 06:48:52,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:52,265 INFO L495 AbstractCegarLoop]: Abstraction has 1705 states and 5272 transitions. [2022-11-19 06:48:52,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 5272 transitions. [2022-11-19 06:48:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 06:48:52,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:52,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:52,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 06:48:52,272 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:52,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:52,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1134873298, now seen corresponding path program 1 times [2022-11-19 06:48:52,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:52,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316812775] [2022-11-19 06:48:52,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:52,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:48:52,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:52,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316812775] [2022-11-19 06:48:52,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316812775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:52,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:52,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:48:52,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742541065] [2022-11-19 06:48:52,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:52,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:48:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:52,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:48:52,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:48:52,881 INFO L87 Difference]: Start difference. First operand 1705 states and 5272 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-11-19 06:48:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:53,170 INFO L93 Difference]: Finished difference Result 1500 states and 4615 transitions. [2022-11-19 06:48:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 06:48:53,171 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-11-19 06:48:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:53,178 INFO L225 Difference]: With dead ends: 1500 [2022-11-19 06:48:53,178 INFO L226 Difference]: Without dead ends: 1331 [2022-11-19 06:48:53,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:48:53,180 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 104 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:53,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 31 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 06:48:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-11-19 06:48:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1259. [2022-11-19 06:48:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1258 states have (on average 3.1176470588235294) internal successors, (3922), 1258 states have internal predecessors, (3922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 3922 transitions. [2022-11-19 06:48:53,263 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 3922 transitions. Word has length 20 [2022-11-19 06:48:53,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:53,263 INFO L495 AbstractCegarLoop]: Abstraction has 1259 states and 3922 transitions. [2022-11-19 06:48:53,263 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-11-19 06:48:53,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 3922 transitions. [2022-11-19 06:48:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 06:48:53,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:53,269 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] [2022-11-19 06:48:53,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 06:48:53,270 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1132231357, now seen corresponding path program 1 times [2022-11-19 06:48:53,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:53,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329394951] [2022-11-19 06:48:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:53,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:48:53,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:53,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329394951] [2022-11-19 06:48:53,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329394951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:53,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:53,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 06:48:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754778530] [2022-11-19 06:48:53,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:53,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:48:53,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:53,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:48:53,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:48:53,733 INFO L87 Difference]: Start difference. First operand 1259 states and 3922 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:54,008 INFO L93 Difference]: Finished difference Result 1223 states and 3849 transitions. [2022-11-19 06:48:54,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 06:48:54,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2022-11-19 06:48:54,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:54,014 INFO L225 Difference]: With dead ends: 1223 [2022-11-19 06:48:54,014 INFO L226 Difference]: Without dead ends: 1146 [2022-11-19 06:48:54,014 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-11-19 06:48:54,016 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 105 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:54,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 31 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:48:54,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2022-11-19 06:48:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1011. [2022-11-19 06:48:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 3.1801980198019804) internal successors, (3212), 1010 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 3212 transitions. [2022-11-19 06:48:54,055 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 3212 transitions. Word has length 24 [2022-11-19 06:48:54,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:54,055 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 3212 transitions. [2022-11-19 06:48:54,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 3212 transitions. [2022-11-19 06:48:54,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 06:48:54,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:54,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:54,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 06:48:54,060 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:54,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1429374241, now seen corresponding path program 1 times [2022-11-19 06:48:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:54,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129279487] [2022-11-19 06:48:54,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:54,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:48:54,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:54,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129279487] [2022-11-19 06:48:54,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129279487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:54,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:54,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:48:54,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548465241] [2022-11-19 06:48:54,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:54,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:48:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:54,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:48:54,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:48:54,545 INFO L87 Difference]: Start difference. First operand 1011 states and 3212 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:54,702 INFO L93 Difference]: Finished difference Result 1517 states and 4756 transitions. [2022-11-19 06:48:54,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:48:54,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2022-11-19 06:48:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:54,707 INFO L225 Difference]: With dead ends: 1517 [2022-11-19 06:48:54,708 INFO L226 Difference]: Without dead ends: 729 [2022-11-19 06:48:54,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:48:54,710 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:54,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 10 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:48:54,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-11-19 06:48:54,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2022-11-19 06:48:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 3.0274725274725274) internal successors, (2204), 728 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 2204 transitions. [2022-11-19 06:48:54,738 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 2204 transitions. Word has length 28 [2022-11-19 06:48:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:54,740 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 2204 transitions. [2022-11-19 06:48:54,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 2204 transitions. [2022-11-19 06:48:54,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 06:48:54,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:54,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:54,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 06:48:54,745 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:54,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1251166115, now seen corresponding path program 2 times [2022-11-19 06:48:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:54,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71959973] [2022-11-19 06:48:54,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:54,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:48:55,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:55,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71959973] [2022-11-19 06:48:55,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71959973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:55,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:55,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:48:55,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711748375] [2022-11-19 06:48:55,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:55,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:48:55,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:55,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:48:55,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:48:55,116 INFO L87 Difference]: Start difference. First operand 729 states and 2204 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:55,309 INFO L93 Difference]: Finished difference Result 1115 states and 3371 transitions. [2022-11-19 06:48:55,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:48:55,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2022-11-19 06:48:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:55,313 INFO L225 Difference]: With dead ends: 1115 [2022-11-19 06:48:55,314 INFO L226 Difference]: Without dead ends: 933 [2022-11-19 06:48:55,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:55,315 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:55,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 8 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:48:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2022-11-19 06:48:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 657. [2022-11-19 06:48:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 656 states have (on average 2.975609756097561) internal successors, (1952), 656 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1952 transitions. [2022-11-19 06:48:55,341 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1952 transitions. Word has length 28 [2022-11-19 06:48:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:55,342 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 1952 transitions. [2022-11-19 06:48:55,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1952 transitions. [2022-11-19 06:48:55,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 06:48:55,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:55,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:55,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 06:48:55,347 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:55,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash 50560735, now seen corresponding path program 3 times [2022-11-19 06:48:55,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:55,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330959915] [2022-11-19 06:48:55,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:48:56,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:56,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330959915] [2022-11-19 06:48:56,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330959915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:56,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:56,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 06:48:56,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788759009] [2022-11-19 06:48:56,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:56,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 06:48:56,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:56,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 06:48:56,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:48:56,812 INFO L87 Difference]: Start difference. First operand 657 states and 1952 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:57,435 INFO L93 Difference]: Finished difference Result 1112 states and 3327 transitions. [2022-11-19 06:48:57,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 06:48:57,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2022-11-19 06:48:57,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:57,445 INFO L225 Difference]: With dead ends: 1112 [2022-11-19 06:48:57,445 INFO L226 Difference]: Without dead ends: 1023 [2022-11-19 06:48:57,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-19 06:48:57,446 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 79 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:57,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 32 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 06:48:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2022-11-19 06:48:57,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 749. [2022-11-19 06:48:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 748 states have (on average 3.0066844919786098) internal successors, (2249), 748 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 2249 transitions. [2022-11-19 06:48:57,476 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 2249 transitions. Word has length 28 [2022-11-19 06:48:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:57,477 INFO L495 AbstractCegarLoop]: Abstraction has 749 states and 2249 transitions. [2022-11-19 06:48:57,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 2249 transitions. [2022-11-19 06:48:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 06:48:57,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:57,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:57,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 06:48:57,482 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:57,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:57,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1677952991, now seen corresponding path program 4 times [2022-11-19 06:48:57,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:57,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883664034] [2022-11-19 06:48:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:57,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:48:57,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:57,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883664034] [2022-11-19 06:48:57,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883664034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:57,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:57,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:48:57,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137003731] [2022-11-19 06:48:57,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:57,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:48:57,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:57,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:48:57,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:57,866 INFO L87 Difference]: Start difference. First operand 749 states and 2249 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:58,122 INFO L93 Difference]: Finished difference Result 1119 states and 3353 transitions. [2022-11-19 06:48:58,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:48:58,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2022-11-19 06:48:58,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:58,126 INFO L225 Difference]: With dead ends: 1119 [2022-11-19 06:48:58,126 INFO L226 Difference]: Without dead ends: 485 [2022-11-19 06:48:58,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:48:58,127 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 47 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:58,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 12 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:48:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-11-19 06:48:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 473. [2022-11-19 06:48:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 2.8389830508474576) internal successors, (1340), 472 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1340 transitions. [2022-11-19 06:48:58,146 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1340 transitions. Word has length 28 [2022-11-19 06:48:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:58,147 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 1340 transitions. [2022-11-19 06:48:58,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1340 transitions. [2022-11-19 06:48:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 06:48:58,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:58,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:58,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 06:48:58,150 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:58,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1330089139, now seen corresponding path program 5 times [2022-11-19 06:48:58,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:58,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421941755] [2022-11-19 06:48:58,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:58,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:48:58,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:58,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421941755] [2022-11-19 06:48:58,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421941755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:58,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:58,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:48:58,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260254143] [2022-11-19 06:48:58,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:58,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:48:58,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:58,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:48:58,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:48:58,560 INFO L87 Difference]: Start difference. First operand 473 states and 1340 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:58,737 INFO L93 Difference]: Finished difference Result 622 states and 1749 transitions. [2022-11-19 06:48:58,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:48:58,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2022-11-19 06:48:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:58,740 INFO L225 Difference]: With dead ends: 622 [2022-11-19 06:48:58,740 INFO L226 Difference]: Without dead ends: 452 [2022-11-19 06:48:58,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:58,741 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:58,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 7 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:48:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-11-19 06:48:58,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 395. [2022-11-19 06:48:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 2.7918781725888326) internal successors, (1100), 394 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1100 transitions. [2022-11-19 06:48:58,759 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1100 transitions. Word has length 28 [2022-11-19 06:48:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:58,760 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 1100 transitions. [2022-11-19 06:48:58,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1100 transitions. [2022-11-19 06:48:58,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 06:48:58,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:58,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:58,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 06:48:58,763 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:58,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash -285900695, now seen corresponding path program 6 times [2022-11-19 06:48:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:58,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931312309] [2022-11-19 06:48:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:58,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:48:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:48:59,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:48:59,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931312309] [2022-11-19 06:48:59,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931312309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:48:59,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:48:59,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:48:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982379905] [2022-11-19 06:48:59,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:48:59,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:48:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:48:59,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:48:59,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:48:59,107 INFO L87 Difference]: Start difference. First operand 395 states and 1100 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:48:59,233 INFO L93 Difference]: Finished difference Result 532 states and 1480 transitions. [2022-11-19 06:48:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:48:59,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2022-11-19 06:48:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:48:59,236 INFO L225 Difference]: With dead ends: 532 [2022-11-19 06:48:59,236 INFO L226 Difference]: Without dead ends: 343 [2022-11-19 06:48:59,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:48:59,236 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:48:59,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 11 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:48:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-19 06:48:59,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2022-11-19 06:48:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 2.7485380116959064) internal successors, (940), 342 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 940 transitions. [2022-11-19 06:48:59,247 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 940 transitions. Word has length 28 [2022-11-19 06:48:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:48:59,248 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 940 transitions. [2022-11-19 06:48:59,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:48:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 940 transitions. [2022-11-19 06:48:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 06:48:59,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:48:59,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:59,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 06:48:59,250 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:48:59,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:48:59,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1129074153, now seen corresponding path program 7 times [2022-11-19 06:48:59,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:48:59,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857464408] [2022-11-19 06:48:59,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:48:59,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:48:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 06:48:59,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 06:48:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 06:48:59,457 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 06:48:59,458 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 06:48:59,459 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-19 06:48:59,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-19 06:48:59,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-19 06:48:59,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-19 06:48:59,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-19 06:48:59,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-19 06:48:59,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-19 06:48:59,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 06:48:59,467 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:48:59,474 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 06:48:59,474 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 06:48:59,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:48:59 BasicIcfg [2022-11-19 06:48:59,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 06:48:59,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 06:48:59,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 06:48:59,617 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 06:48:59,617 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:48:39" (3/4) ... [2022-11-19 06:48:59,619 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 06:48:59,773 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 06:48:59,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 06:48:59,775 INFO L158 Benchmark]: Toolchain (without parser) took 22651.69ms. Allocated memory was 104.9MB in the beginning and 715.1MB in the end (delta: 610.3MB). Free memory was 63.1MB in the beginning and 268.3MB in the end (delta: -205.2MB). Peak memory consumption was 405.7MB. Max. memory is 16.1GB. [2022-11-19 06:48:59,775 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 104.9MB. Free memory was 81.4MB in the beginning and 81.4MB in the end (delta: 57.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:48:59,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 816.69ms. Allocated memory is still 104.9MB. Free memory was 62.9MB in the beginning and 66.8MB in the end (delta: -3.9MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2022-11-19 06:48:59,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.62ms. Allocated memory is still 104.9MB. Free memory was 66.8MB in the beginning and 64.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:48:59,776 INFO L158 Benchmark]: Boogie Preprocessor took 76.03ms. Allocated memory is still 104.9MB. Free memory was 64.4MB in the beginning and 62.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:48:59,777 INFO L158 Benchmark]: RCFGBuilder took 1028.15ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 62.3MB in the beginning and 89.5MB in the end (delta: -27.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-19 06:48:59,777 INFO L158 Benchmark]: TraceAbstraction took 20455.46ms. Allocated memory was 130.0MB in the beginning and 715.1MB in the end (delta: 585.1MB). Free memory was 88.8MB in the beginning and 285.2MB in the end (delta: -196.4MB). Peak memory consumption was 388.3MB. Max. memory is 16.1GB. [2022-11-19 06:48:59,778 INFO L158 Benchmark]: Witness Printer took 157.55ms. Allocated memory is still 715.1MB. Free memory was 285.2MB in the beginning and 268.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-19 06:48:59,780 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.35ms. Allocated memory is still 104.9MB. Free memory was 81.4MB in the beginning and 81.4MB in the end (delta: 57.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 816.69ms. Allocated memory is still 104.9MB. Free memory was 62.9MB in the beginning and 66.8MB in the end (delta: -3.9MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.62ms. Allocated memory is still 104.9MB. Free memory was 66.8MB in the beginning and 64.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.03ms. Allocated memory is still 104.9MB. Free memory was 64.4MB in the beginning and 62.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1028.15ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 62.3MB in the beginning and 89.5MB in the end (delta: -27.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20455.46ms. Allocated memory was 130.0MB in the beginning and 715.1MB in the end (delta: 585.1MB). Free memory was 88.8MB in the beginning and 285.2MB in the end (delta: -196.4MB). Peak memory consumption was 388.3MB. Max. memory is 16.1GB. * Witness Printer took 157.55ms. Allocated memory is still 715.1MB. Free memory was 285.2MB in the beginning and 268.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 149 PlacesBefore, 47 PlacesAfterwards, 138 TransitionsBefore, 35 TransitionsAfterwards, 3404 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 9774 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4556, independent: 4315, independent conditional: 0, independent unconditional: 4315, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2492, independent: 2405, independent conditional: 0, independent unconditional: 2405, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2492, independent: 2378, independent conditional: 0, independent unconditional: 2378, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 114, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 685, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 638, dependent conditional: 0, dependent unconditional: 638, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4556, independent: 1910, independent conditional: 0, independent unconditional: 1910, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 2492, unknown conditional: 0, unknown unconditional: 2492] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 255, Positive conditional cache size: 0, Positive unconditional cache size: 255, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L738] 0 _Bool a$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L722] 0 int a$mem_tmp; [L733] 0 _Bool a$read_delayed; [L712] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L731] 0 _Bool a$r_buff1_thd3; [L714] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$r_buff1_thd1; [L735] 0 int a$w_buff0; [L730] 0 _Bool a$r_buff1_thd2; [L737] 0 int a$w_buff1; [L721] 0 _Bool a$flush_delayed; [L728] 0 _Bool a$r_buff1_thd0; [L710] 0 int __unbuffered_cnt = 0; [L734] 0 int *a$read_delayed_var; [L740] 0 _Bool main$tmp_guard1; [L739] 0 _Bool main$tmp_guard0; [L736] 0 _Bool a$w_buff0_used; [L724] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd0; [L716] 0 int __unbuffered_p3_EAX = 0; [L726] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd4; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L866] 0 pthread_t t465; [L867] FCALL, FORK 0 pthread_create(&t465, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t465, ((void *)0), P0, ((void *)0))=-3, t465={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t466; [L869] FCALL, FORK 0 pthread_create(&t466, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t466, ((void *)0), P1, ((void *)0))=-2, t465={5:0}, t466={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t467; [L871] FCALL, FORK 0 pthread_create(&t467, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t467, ((void *)0), P2, ((void *)0))=-1, t465={5:0}, t466={6:0}, t467={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t468; [L873] FCALL, FORK 0 pthread_create(&t468, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t468, ((void *)0), P3, ((void *)0))=0, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L805] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L822] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=0, weak$$choice2=0, x=2, y=1, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=1] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=1] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L886] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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] - 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: 871]: 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: 869]: 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: 873]: 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: 867]: 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, 175 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 666 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 666 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1574 IncrementalHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 90 mSDtfsCounter, 1574 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4525occurred in iteration=2, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 2968 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 1900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-19 06:48:59,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_785311a5-b61b-4429-a905-37f92dea0ac1/bin/utaipan-I9t0OCRTmS/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