./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0 --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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf --- 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-e04fb08 [2022-11-16 16:08:16,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 16:08:16,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 16:08:16,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 16:08:16,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 16:08:16,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 16:08:16,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 16:08:16,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 16:08:16,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 16:08:16,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 16:08:16,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 16:08:16,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 16:08:16,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 16:08:16,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 16:08:16,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 16:08:16,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 16:08:16,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 16:08:16,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 16:08:16,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 16:08:16,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 16:08:16,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 16:08:16,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 16:08:16,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 16:08:16,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 16:08:16,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 16:08:16,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 16:08:16,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 16:08:16,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 16:08:16,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 16:08:16,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 16:08:16,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 16:08:16,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 16:08:16,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 16:08:16,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 16:08:16,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 16:08:16,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 16:08:16,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 16:08:16,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 16:08:16,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 16:08:16,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 16:08:16,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 16:08:16,319 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-16 16:08:16,370 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 16:08:16,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 16:08:16,371 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 16:08:16,371 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 16:08:16,372 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 16:08:16,372 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 16:08:16,372 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 16:08:16,373 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 16:08:16,373 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 16:08:16,373 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 16:08:16,374 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 16:08:16,374 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 16:08:16,375 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 16:08:16,375 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 16:08:16,375 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 16:08:16,375 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 16:08:16,375 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 16:08:16,376 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 16:08:16,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 16:08:16,377 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 16:08:16,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 16:08:16,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 16:08:16,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 16:08:16,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 16:08:16,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 16:08:16,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 16:08:16,379 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 16:08:16,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 16:08:16,380 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 16:08:16,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 16:08:16,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 16:08:16,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 16:08:16,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 16:08:16,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 16:08:16,381 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 16:08:16,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 16:08:16,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 16:08:16,382 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 16:08:16,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 16:08:16,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 16:08:16,382 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 16:08:16,383 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_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/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_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0 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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf [2022-11-16 16:08:16,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 16:08:16,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 16:08:16,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 16:08:16,784 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 16:08:16,785 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 16:08:16,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 16:08:16,885 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/data/78b5d82c6/ae1309ef35334eb498666671f3703393/FLAG81b3230fb [2022-11-16 16:08:17,514 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 16:08:17,521 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 16:08:17,544 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/data/78b5d82c6/ae1309ef35334eb498666671f3703393/FLAG81b3230fb [2022-11-16 16:08:17,774 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/data/78b5d82c6/ae1309ef35334eb498666671f3703393 [2022-11-16 16:08:17,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 16:08:17,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 16:08:17,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 16:08:17,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 16:08:17,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 16:08:17,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:08:17" (1/1) ... [2022-11-16 16:08:17,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7414a5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:17, skipping insertion in model container [2022-11-16 16:08:17,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:08:17" (1/1) ... [2022-11-16 16:08:17,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 16:08:17,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 16:08:18,126 WARN L229 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_aa4eefb5-61cc-4293-908d-e1fb03393dae/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-11-16 16:08:18,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 16:08:18,439 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 16:08:18,453 WARN L229 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_aa4eefb5-61cc-4293-908d-e1fb03393dae/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-11-16 16:08:18,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 16:08:18,552 INFO L208 MainTranslator]: Completed translation [2022-11-16 16:08:18,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:18 WrapperNode [2022-11-16 16:08:18,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 16:08:18,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 16:08:18,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 16:08:18,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 16:08:18,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:18" (1/1) ... [2022-11-16 16:08:18,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:18" (1/1) ... [2022-11-16 16:08:18,651 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-16 16:08:18,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 16:08:18,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 16:08:18,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 16:08:18,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 16:08:18,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:18" (1/1) ... [2022-11-16 16:08:18,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:18" (1/1) ... [2022-11-16 16:08:18,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:18" (1/1) ... [2022-11-16 16:08:18,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:18" (1/1) ... [2022-11-16 16:08:18,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:18" (1/1) ... [2022-11-16 16:08:18,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:18" (1/1) ... [2022-11-16 16:08:18,722 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:18" (1/1) ... [2022-11-16 16:08:18,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:18" (1/1) ... [2022-11-16 16:08:18,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 16:08:18,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 16:08:18,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 16:08:18,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 16:08:18,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:18" (1/1) ... [2022-11-16 16:08:18,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 16:08:18,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 16:08:18,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 16:08:18,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 16:08:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 16:08:18,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 16:08:18,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 16:08:18,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 16:08:18,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 16:08:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 16:08:18,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 16:08:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 16:08:18,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 16:08:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 16:08:18,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 16:08:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 16:08:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 16:08:18,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 16:08:18,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 16:08:18,836 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 16:08:19,056 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 16:08:19,069 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 16:08:19,547 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 16:08:19,828 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 16:08:19,829 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 16:08:19,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 04:08:19 BoogieIcfgContainer [2022-11-16 16:08:19,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 16:08:19,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 16:08:19,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 16:08:19,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 16:08:19,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:08:17" (1/3) ... [2022-11-16 16:08:19,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770e735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:08:19, skipping insertion in model container [2022-11-16 16:08:19,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:08:18" (2/3) ... [2022-11-16 16:08:19,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770e735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:08:19, skipping insertion in model container [2022-11-16 16:08:19,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 04:08:19" (3/3) ... [2022-11-16 16:08:19,845 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 16:08:19,854 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 16:08:19,867 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 16:08:19,869 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 16:08:19,869 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 16:08:19,974 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 16:08:20,027 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 16:08:20,046 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 245 flow [2022-11-16 16:08:20,052 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 245 flow [2022-11-16 16:08:20,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-16 16:08:20,151 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-16 16:08:20,151 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 16:08:20,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-16 16:08:20,159 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2022-11-16 16:08:26,960 INFO L134 LiptonReduction]: Checked pairs total: 5588 [2022-11-16 16:08:26,961 INFO L136 LiptonReduction]: Total number of compositions: 102 [2022-11-16 16:08:26,969 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2022-11-16 16:08:27,036 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 724 states, 721 states have (on average 3.1858529819694867) internal successors, (2297), 723 states have internal predecessors, (2297), 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-16 16:08:27,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 16:08:27,061 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;@1c0dc4a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 16:08:27,061 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 16:08:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 724 states, 721 states have (on average 3.1858529819694867) internal successors, (2297), 723 states have internal predecessors, (2297), 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-16 16:08:27,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 16:08:27,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:27,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 16:08:27,071 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:27,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:27,077 INFO L85 PathProgramCache]: Analyzing trace with hash 551830, now seen corresponding path program 1 times [2022-11-16 16:08:27,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:27,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968621067] [2022-11-16 16:08:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:27,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:27,589 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-16 16:08:27,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:27,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968621067] [2022-11-16 16:08:27,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968621067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:27,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:27,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 16:08:27,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468039632] [2022-11-16 16:08:27,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:27,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 16:08:27,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:27,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 16:08:27,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 16:08:27,628 INFO L87 Difference]: Start difference. First operand has 724 states, 721 states have (on average 3.1858529819694867) internal successors, (2297), 723 states have internal predecessors, (2297), 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-16 16:08:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:27,783 INFO L93 Difference]: Finished difference Result 587 states and 1790 transitions. [2022-11-16 16:08:27,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:08:27,789 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-16 16:08:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:27,806 INFO L225 Difference]: With dead ends: 587 [2022-11-16 16:08:27,806 INFO L226 Difference]: Without dead ends: 562 [2022-11-16 16:08:27,807 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-16 16:08:27,810 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:27,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:08:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-16 16:08:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-11-16 16:08:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 3.0748663101604277) internal successors, (1725), 561 states have internal predecessors, (1725), 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-16 16:08:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2022-11-16 16:08:27,900 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2022-11-16 16:08:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:27,901 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2022-11-16 16:08:27,901 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-16 16:08:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2022-11-16 16:08:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 16:08:27,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:27,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:27,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 16:08:27,904 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1055845072, now seen corresponding path program 1 times [2022-11-16 16:08:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:27,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032728704] [2022-11-16 16:08:27,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:27,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:29,111 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-16 16:08:29,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:29,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032728704] [2022-11-16 16:08:29,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032728704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:29,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:29,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 16:08:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546300799] [2022-11-16 16:08:29,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:29,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 16:08:29,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:29,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 16:08:29,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:08:29,115 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:29,261 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2022-11-16 16:08:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:08:29,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 16:08:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:29,267 INFO L225 Difference]: With dead ends: 537 [2022-11-16 16:08:29,267 INFO L226 Difference]: Without dead ends: 537 [2022-11-16 16:08:29,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:08:29,269 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:29,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:08:29,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-11-16 16:08:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2022-11-16 16:08:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 3.050373134328358) internal successors, (1635), 536 states have internal predecessors, (1635), 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-16 16:08:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2022-11-16 16:08:29,300 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 9 [2022-11-16 16:08:29,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:29,301 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2022-11-16 16:08:29,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2022-11-16 16:08:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 16:08:29,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:29,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:29,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 16:08:29,304 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:29,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:29,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1628539761, now seen corresponding path program 1 times [2022-11-16 16:08:29,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:29,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559030597] [2022-11-16 16:08:29,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:29,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:30,268 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-16 16:08:30,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:30,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559030597] [2022-11-16 16:08:30,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559030597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:30,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:30,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 16:08:30,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919044425] [2022-11-16 16:08:30,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:30,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 16:08:30,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:30,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 16:08:30,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:08:30,272 INFO L87 Difference]: Start difference. First operand 537 states and 1635 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:30,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:30,380 INFO L93 Difference]: Finished difference Result 512 states and 1545 transitions. [2022-11-16 16:08:30,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:08:30,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 16:08:30,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:30,385 INFO L225 Difference]: With dead ends: 512 [2022-11-16 16:08:30,385 INFO L226 Difference]: Without dead ends: 512 [2022-11-16 16:08:30,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:08:30,387 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:30,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:08:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-11-16 16:08:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2022-11-16 16:08:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 3.0234833659491196) internal successors, (1545), 511 states have internal predecessors, (1545), 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-16 16:08:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1545 transitions. [2022-11-16 16:08:30,415 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1545 transitions. Word has length 10 [2022-11-16 16:08:30,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:30,416 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 1545 transitions. [2022-11-16 16:08:30,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:30,416 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1545 transitions. [2022-11-16 16:08:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 16:08:30,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:30,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:30,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 16:08:30,419 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:30,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:30,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1054877483, now seen corresponding path program 1 times [2022-11-16 16:08:30,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:30,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483759913] [2022-11-16 16:08:30,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:30,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:31,978 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-16 16:08:31,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:31,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483759913] [2022-11-16 16:08:31,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483759913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:31,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:31,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 16:08:31,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424468894] [2022-11-16 16:08:31,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:31,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 16:08:31,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:31,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 16:08:31,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 16:08:31,981 INFO L87 Difference]: Start difference. First operand 512 states and 1545 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-16 16:08:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:32,203 INFO L93 Difference]: Finished difference Result 782 states and 2346 transitions. [2022-11-16 16:08:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:08:32,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-16 16:08:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:32,208 INFO L225 Difference]: With dead ends: 782 [2022-11-16 16:08:32,208 INFO L226 Difference]: Without dead ends: 482 [2022-11-16 16:08:32,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 16:08:32,210 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:32,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 7 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 16:08:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-16 16:08:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2022-11-16 16:08:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 2.9833679833679834) internal successors, (1435), 481 states have internal predecessors, (1435), 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-16 16:08:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1435 transitions. [2022-11-16 16:08:32,229 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1435 transitions. Word has length 11 [2022-11-16 16:08:32,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:32,229 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 1435 transitions. [2022-11-16 16:08:32,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-16 16:08:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1435 transitions. [2022-11-16 16:08:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 16:08:32,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:32,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:32,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 16:08:32,232 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:32,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:32,233 INFO L85 PathProgramCache]: Analyzing trace with hash -583777448, now seen corresponding path program 1 times [2022-11-16 16:08:32,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:32,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667512101] [2022-11-16 16:08:32,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:32,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:33,098 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-16 16:08:33,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:33,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667512101] [2022-11-16 16:08:33,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667512101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:33,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:33,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 16:08:33,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817822475] [2022-11-16 16:08:33,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:33,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 16:08:33,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:33,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 16:08:33,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:08:33,100 INFO L87 Difference]: Start difference. First operand 482 states and 1435 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-16 16:08:33,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:33,237 INFO L93 Difference]: Finished difference Result 470 states and 1394 transitions. [2022-11-16 16:08:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 16:08:33,239 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-16 16:08:33,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:33,243 INFO L225 Difference]: With dead ends: 470 [2022-11-16 16:08:33,243 INFO L226 Difference]: Without dead ends: 470 [2022-11-16 16:08:33,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:08:33,244 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:33,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:08:33,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-11-16 16:08:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-11-16 16:08:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 2.9722814498933903) internal successors, (1394), 469 states have internal predecessors, (1394), 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-16 16:08:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1394 transitions. [2022-11-16 16:08:33,283 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1394 transitions. Word has length 12 [2022-11-16 16:08:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:33,284 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 1394 transitions. [2022-11-16 16:08:33,284 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-16 16:08:33,284 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1394 transitions. [2022-11-16 16:08:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 16:08:33,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:33,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:33,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 16:08:33,290 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:33,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1001185595, now seen corresponding path program 1 times [2022-11-16 16:08:33,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:33,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610569639] [2022-11-16 16:08:33,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:33,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:34,163 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-16 16:08:34,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:34,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610569639] [2022-11-16 16:08:34,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610569639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:34,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:34,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 16:08:34,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385653352] [2022-11-16 16:08:34,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:34,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 16:08:34,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:34,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 16:08:34,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 16:08:34,165 INFO L87 Difference]: Start difference. First operand 470 states and 1394 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-16 16:08:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:34,331 INFO L93 Difference]: Finished difference Result 653 states and 1900 transitions. [2022-11-16 16:08:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 16:08:34,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-16 16:08:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:34,334 INFO L225 Difference]: With dead ends: 653 [2022-11-16 16:08:34,334 INFO L226 Difference]: Without dead ends: 325 [2022-11-16 16:08:34,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 16:08:34,335 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:34,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 5 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:08:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-16 16:08:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-11-16 16:08:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 2.824074074074074) internal successors, (915), 324 states have internal predecessors, (915), 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-16 16:08:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 915 transitions. [2022-11-16 16:08:34,348 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 915 transitions. Word has length 13 [2022-11-16 16:08:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:34,348 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 915 transitions. [2022-11-16 16:08:34,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-16 16:08:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 915 transitions. [2022-11-16 16:08:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 16:08:34,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:34,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:34,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 16:08:34,350 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash 701636353, now seen corresponding path program 1 times [2022-11-16 16:08:34,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:34,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377179768] [2022-11-16 16:08:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:35,032 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-16 16:08:35,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:35,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377179768] [2022-11-16 16:08:35,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377179768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:35,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:35,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 16:08:35,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245872954] [2022-11-16 16:08:35,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:35,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 16:08:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:35,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 16:08:35,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 16:08:35,035 INFO L87 Difference]: Start difference. First operand 325 states and 915 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:35,231 INFO L93 Difference]: Finished difference Result 478 states and 1341 transitions. [2022-11-16 16:08:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 16:08:35,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 16:08:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:35,234 INFO L225 Difference]: With dead ends: 478 [2022-11-16 16:08:35,234 INFO L226 Difference]: Without dead ends: 286 [2022-11-16 16:08:35,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 16:08:35,235 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 55 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:35,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:08:35,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-16 16:08:35,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-11-16 16:08:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 2.7508771929824563) internal successors, (784), 285 states have internal predecessors, (784), 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-16 16:08:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 784 transitions. [2022-11-16 16:08:35,245 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 784 transitions. Word has length 14 [2022-11-16 16:08:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:35,246 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 784 transitions. [2022-11-16 16:08:35,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 784 transitions. [2022-11-16 16:08:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 16:08:35,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:35,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:35,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 16:08:35,248 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1791406916, now seen corresponding path program 1 times [2022-11-16 16:08:35,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:35,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702893808] [2022-11-16 16:08:35,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:35,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:36,718 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-16 16:08:36,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:36,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702893808] [2022-11-16 16:08:36,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702893808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:36,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:36,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 16:08:36,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487374303] [2022-11-16 16:08:36,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:36,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 16:08:36,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:36,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 16:08:36,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 16:08:36,722 INFO L87 Difference]: Start difference. First operand 286 states and 784 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:36,931 INFO L93 Difference]: Finished difference Result 373 states and 1004 transitions. [2022-11-16 16:08:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 16:08:36,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 16:08:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:36,934 INFO L225 Difference]: With dead ends: 373 [2022-11-16 16:08:36,934 INFO L226 Difference]: Without dead ends: 353 [2022-11-16 16:08:36,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-16 16:08:36,935 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 57 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:36,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 5 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:08:36,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-11-16 16:08:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 305. [2022-11-16 16:08:36,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 2.6710526315789473) internal successors, (812), 304 states have internal predecessors, (812), 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-16 16:08:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 812 transitions. [2022-11-16 16:08:36,949 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 812 transitions. Word has length 15 [2022-11-16 16:08:36,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:36,949 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 812 transitions. [2022-11-16 16:08:36,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:36,950 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 812 transitions. [2022-11-16 16:08:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 16:08:36,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:36,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:36,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 16:08:36,952 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1793197166, now seen corresponding path program 2 times [2022-11-16 16:08:36,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:36,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154160527] [2022-11-16 16:08:36,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:36,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:38,157 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-16 16:08:38,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:38,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154160527] [2022-11-16 16:08:38,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154160527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:38,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:38,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 16:08:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087219785] [2022-11-16 16:08:38,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:38,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 16:08:38,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:38,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 16:08:38,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 16:08:38,159 INFO L87 Difference]: Start difference. First operand 305 states and 812 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:38,763 INFO L93 Difference]: Finished difference Result 505 states and 1325 transitions. [2022-11-16 16:08:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 16:08:38,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 16:08:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:38,767 INFO L225 Difference]: With dead ends: 505 [2022-11-16 16:08:38,767 INFO L226 Difference]: Without dead ends: 329 [2022-11-16 16:08:38,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 16:08:38,768 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 70 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:38,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 12 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 16:08:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-16 16:08:38,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 289. [2022-11-16 16:08:38,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 2.5868055555555554) internal successors, (745), 288 states have internal predecessors, (745), 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-16 16:08:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 745 transitions. [2022-11-16 16:08:38,784 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 745 transitions. Word has length 15 [2022-11-16 16:08:38,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:38,785 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 745 transitions. [2022-11-16 16:08:38,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 745 transitions. [2022-11-16 16:08:38,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 16:08:38,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:38,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:38,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 16:08:38,787 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:38,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:38,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2008927474, now seen corresponding path program 1 times [2022-11-16 16:08:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:38,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845472776] [2022-11-16 16:08:38,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:40,051 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-16 16:08:40,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:40,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845472776] [2022-11-16 16:08:40,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845472776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:40,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:40,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 16:08:40,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107405989] [2022-11-16 16:08:40,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:40,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 16:08:40,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:40,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 16:08:40,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-16 16:08:40,053 INFO L87 Difference]: Start difference. First operand 289 states and 745 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:40,326 INFO L93 Difference]: Finished difference Result 372 states and 947 transitions. [2022-11-16 16:08:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 16:08:40,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 16:08:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:40,328 INFO L225 Difference]: With dead ends: 372 [2022-11-16 16:08:40,329 INFO L226 Difference]: Without dead ends: 312 [2022-11-16 16:08:40,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-16 16:08:40,329 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 59 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:40,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 5 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 16:08:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-11-16 16:08:40,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 265. [2022-11-16 16:08:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 2.4886363636363638) internal successors, (657), 264 states have internal predecessors, (657), 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-16 16:08:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 657 transitions. [2022-11-16 16:08:40,341 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 657 transitions. Word has length 15 [2022-11-16 16:08:40,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:40,341 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 657 transitions. [2022-11-16 16:08:40,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 657 transitions. [2022-11-16 16:08:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 16:08:40,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:40,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:40,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 16:08:40,343 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:40,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:40,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2092262921, now seen corresponding path program 1 times [2022-11-16 16:08:40,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:40,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388145587] [2022-11-16 16:08:40,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:40,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:40,584 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-16 16:08:40,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:40,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388145587] [2022-11-16 16:08:40,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388145587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:40,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:40,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 16:08:40,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735489377] [2022-11-16 16:08:40,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:40,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 16:08:40,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:40,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 16:08:40,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 16:08:40,587 INFO L87 Difference]: Start difference. First operand 265 states and 657 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:40,725 INFO L93 Difference]: Finished difference Result 253 states and 561 transitions. [2022-11-16 16:08:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 16:08:40,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 16:08:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:40,727 INFO L225 Difference]: With dead ends: 253 [2022-11-16 16:08:40,727 INFO L226 Difference]: Without dead ends: 194 [2022-11-16 16:08:40,727 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-16 16:08:40,728 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:40,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 8 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:08:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-16 16:08:40,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-11-16 16:08:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 2.2020725388601035) internal successors, (425), 193 states have internal predecessors, (425), 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-16 16:08:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 425 transitions. [2022-11-16 16:08:40,735 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 425 transitions. Word has length 16 [2022-11-16 16:08:40,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:40,736 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 425 transitions. [2022-11-16 16:08:40,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 16:08:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 425 transitions. [2022-11-16 16:08:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 16:08:40,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:40,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:40,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 16:08:40,738 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1131245932, now seen corresponding path program 1 times [2022-11-16 16:08:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:40,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272292754] [2022-11-16 16:08:40,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:40,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:40,991 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-16 16:08:40,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:40,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272292754] [2022-11-16 16:08:40,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272292754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:40,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:40,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 16:08:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530809690] [2022-11-16 16:08:40,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:40,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 16:08:40,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:40,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 16:08:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 16:08:40,995 INFO L87 Difference]: Start difference. First operand 194 states and 425 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-16 16:08:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:41,149 INFO L93 Difference]: Finished difference Result 160 states and 317 transitions. [2022-11-16 16:08:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 16:08:41,150 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-16 16:08:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:41,151 INFO L225 Difference]: With dead ends: 160 [2022-11-16 16:08:41,151 INFO L226 Difference]: Without dead ends: 120 [2022-11-16 16:08:41,152 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-16 16:08:41,152 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:41,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 7 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:08:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-16 16:08:41,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-16 16:08:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.949579831932773) internal successors, (232), 119 states have internal predecessors, (232), 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-16 16:08:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 232 transitions. [2022-11-16 16:08:41,157 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 232 transitions. Word has length 17 [2022-11-16 16:08:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:41,157 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 232 transitions. [2022-11-16 16:08:41,157 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-16 16:08:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 232 transitions. [2022-11-16 16:08:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 16:08:41,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:41,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:41,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 16:08:41,159 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:41,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:41,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1501239479, now seen corresponding path program 1 times [2022-11-16 16:08:41,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:41,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030990358] [2022-11-16 16:08:41,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:41,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:42,916 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-16 16:08:42,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:42,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030990358] [2022-11-16 16:08:42,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030990358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:42,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:42,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 16:08:42,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494438003] [2022-11-16 16:08:42,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:42,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 16:08:42,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:42,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 16:08:42,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-16 16:08:42,918 INFO L87 Difference]: Start difference. First operand 120 states and 232 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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-16 16:08:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:43,269 INFO L93 Difference]: Finished difference Result 152 states and 290 transitions. [2022-11-16 16:08:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 16:08:43,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 19 [2022-11-16 16:08:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:43,271 INFO L225 Difference]: With dead ends: 152 [2022-11-16 16:08:43,272 INFO L226 Difference]: Without dead ends: 98 [2022-11-16 16:08:43,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-16 16:08:43,272 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 56 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:43,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 16:08:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-16 16:08:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-11-16 16:08:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.8865979381443299) internal successors, (183), 97 states have internal predecessors, (183), 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-16 16:08:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 183 transitions. [2022-11-16 16:08:43,277 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 183 transitions. Word has length 19 [2022-11-16 16:08:43,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:43,278 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 183 transitions. [2022-11-16 16:08:43,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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-16 16:08:43,278 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 183 transitions. [2022-11-16 16:08:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 16:08:43,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:43,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:43,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 16:08:43,280 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:43,280 INFO L85 PathProgramCache]: Analyzing trace with hash -283441865, now seen corresponding path program 2 times [2022-11-16 16:08:43,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:43,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697505407] [2022-11-16 16:08:43,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:43,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 16:08:43,551 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-16 16:08:43,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 16:08:43,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697505407] [2022-11-16 16:08:43,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697505407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 16:08:43,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 16:08:43,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 16:08:43,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660820976] [2022-11-16 16:08:43,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 16:08:43,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 16:08:43,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 16:08:43,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 16:08:43,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 16:08:43,554 INFO L87 Difference]: Start difference. First operand 98 states and 183 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-16 16:08:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 16:08:43,676 INFO L93 Difference]: Finished difference Result 85 states and 155 transitions. [2022-11-16 16:08:43,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 16:08:43,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-11-16 16:08:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 16:08:43,677 INFO L225 Difference]: With dead ends: 85 [2022-11-16 16:08:43,678 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 16:08:43,678 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-16 16:08:43,679 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 16:08:43,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 4 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 16:08:43,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 16:08:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2022-11-16 16:08:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7936507936507937) internal successors, (113), 63 states have internal predecessors, (113), 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-16 16:08:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2022-11-16 16:08:43,682 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2022-11-16 16:08:43,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 16:08:43,682 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2022-11-16 16:08:43,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-16 16:08:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2022-11-16 16:08:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 16:08:43,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 16:08:43,684 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] [2022-11-16 16:08:43,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 16:08:43,684 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 16:08:43,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 16:08:43,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1901204534, now seen corresponding path program 1 times [2022-11-16 16:08:43,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 16:08:43,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775384603] [2022-11-16 16:08:43,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 16:08:43,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 16:08:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 16:08:43,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 16:08:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 16:08:43,845 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-16 16:08:43,859 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 16:08:43,860 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 16:08:43,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 16:08:43,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 16:08:43,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 16:08:43,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 16:08:43,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 16:08:43,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 16:08:43,871 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 16:08:43,877 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 16:08:43,877 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 16:08:43,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:08:43 BasicIcfg [2022-11-16 16:08:43,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 16:08:43,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 16:08:43,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 16:08:43,945 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 16:08:43,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 04:08:19" (3/4) ... [2022-11-16 16:08:43,947 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 16:08:44,046 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/witness.graphml [2022-11-16 16:08:44,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 16:08:44,047 INFO L158 Benchmark]: Toolchain (without parser) took 26266.15ms. Allocated memory was 109.1MB in the beginning and 400.6MB in the end (delta: 291.5MB). Free memory was 73.3MB in the beginning and 275.3MB in the end (delta: -201.9MB). Peak memory consumption was 89.6MB. Max. memory is 16.1GB. [2022-11-16 16:08:44,048 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory was 79.9MB in the beginning and 79.9MB in the end (delta: 27.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 16:08:44,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 767.96ms. Allocated memory is still 109.1MB. Free memory was 73.1MB in the beginning and 68.6MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 16:08:44,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.93ms. Allocated memory is still 109.1MB. Free memory was 68.6MB in the beginning and 65.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 16:08:44,049 INFO L158 Benchmark]: Boogie Preprocessor took 75.03ms. Allocated memory is still 109.1MB. Free memory was 65.7MB in the beginning and 63.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 16:08:44,050 INFO L158 Benchmark]: RCFGBuilder took 1104.70ms. Allocated memory was 109.1MB in the beginning and 148.9MB in the end (delta: 39.8MB). Free memory was 63.6MB in the beginning and 89.2MB in the end (delta: -25.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2022-11-16 16:08:44,050 INFO L158 Benchmark]: TraceAbstraction took 24107.89ms. Allocated memory was 148.9MB in the beginning and 400.6MB in the end (delta: 251.7MB). Free memory was 88.1MB in the beginning and 286.8MB in the end (delta: -198.7MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2022-11-16 16:08:44,051 INFO L158 Benchmark]: Witness Printer took 102.67ms. Allocated memory is still 400.6MB. Free memory was 286.8MB in the beginning and 275.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 16:08:44,061 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.29ms. Allocated memory is still 109.1MB. Free memory was 79.9MB in the beginning and 79.9MB in the end (delta: 27.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 767.96ms. Allocated memory is still 109.1MB. Free memory was 73.1MB in the beginning and 68.6MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.93ms. Allocated memory is still 109.1MB. Free memory was 68.6MB in the beginning and 65.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.03ms. Allocated memory is still 109.1MB. Free memory was 65.7MB in the beginning and 63.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1104.70ms. Allocated memory was 109.1MB in the beginning and 148.9MB in the end (delta: 39.8MB). Free memory was 63.6MB in the beginning and 89.2MB in the end (delta: -25.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 24107.89ms. Allocated memory was 148.9MB in the beginning and 400.6MB in the end (delta: 251.7MB). Free memory was 88.1MB in the beginning and 286.8MB in the end (delta: -198.7MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. * Witness Printer took 102.67ms. Allocated memory is still 400.6MB. Free memory was 286.8MB in the beginning and 275.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 123 PlacesBefore, 36 PlacesAfterwards, 115 TransitionsBefore, 27 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 102 TotalNumberOfCompositions, 5588 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2254, independent: 2073, independent conditional: 0, independent unconditional: 2073, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1392, independent: 1337, independent conditional: 0, independent unconditional: 1337, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1392, independent: 1307, independent conditional: 0, independent unconditional: 1307, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 85, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 761, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 708, dependent conditional: 0, dependent unconditional: 708, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2254, independent: 736, independent conditional: 0, independent unconditional: 736, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 1392, unknown conditional: 0, unknown unconditional: 1392] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: [L715] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L734] 0 int y$w_buff0; [L736] 0 int y$w_buff1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L723] 0 int y$mem_tmp; [L711] 0 int __unbuffered_p1_EAX = 0; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$read_delayed; [L713] 0 int __unbuffered_p2_EAX = 0; [L709] 0 int __unbuffered_cnt = 0; [L722] 0 _Bool y$flush_delayed; [L737] 0 _Bool y$w_buff1_used; [L717] 0 _Bool main$tmp_guard1; [L716] 0 _Bool main$tmp_guard0; [L733] 0 int *y$read_delayed_var; [L735] 0 _Bool y$w_buff0_used; [L719] 0 int x = 0; [L728] 0 _Bool y$r_buff1_thd0; [L721] 0 int y = 0; [L730] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd3; [L846] 0 pthread_t t1849; [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=-2, t1849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1850; [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=-1, t1849={5:0}, t1850={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L850] 0 pthread_t t1851; [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=57, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=56, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 851]: 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 23.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 542 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 542 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1181 IncrementalHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 34 mSDtfsCounter, 1181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=724occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 2629 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-16 16:08:44,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa4eefb5-61cc-4293-908d-e1fb03393dae/bin/utaipan-Xvt2sAort0/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