./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018.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_4431540f-5af8-489a-afa4-038be0e34dea/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/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_4431540f-5af8-489a-afa4-038be0e34dea/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/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_4431540f-5af8-489a-afa4-038be0e34dea/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 a7349305eeae716fa3a7c11218caa894d6e5121d77db0055a98af7bd7c666586 --- 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 15:52:38,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 15:52:38,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 15:52:38,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 15:52:38,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 15:52:38,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 15:52:38,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 15:52:38,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 15:52:38,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 15:52:38,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 15:52:38,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 15:52:38,400 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 15:52:38,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 15:52:38,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 15:52:38,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 15:52:38,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 15:52:38,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 15:52:38,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 15:52:38,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 15:52:38,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 15:52:38,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 15:52:38,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 15:52:38,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 15:52:38,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 15:52:38,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 15:52:38,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 15:52:38,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 15:52:38,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 15:52:38,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 15:52:38,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 15:52:38,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 15:52:38,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 15:52:38,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 15:52:38,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 15:52:38,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 15:52:38,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 15:52:38,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 15:52:38,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 15:52:38,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 15:52:38,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 15:52:38,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 15:52:38,434 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-16 15:52:38,456 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 15:52:38,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 15:52:38,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 15:52:38,458 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 15:52:38,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 15:52:38,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 15:52:38,459 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 15:52:38,459 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 15:52:38,459 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 15:52:38,460 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 15:52:38,460 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 15:52:38,460 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 15:52:38,461 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 15:52:38,461 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 15:52:38,461 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 15:52:38,461 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 15:52:38,462 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 15:52:38,462 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 15:52:38,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 15:52:38,463 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 15:52:38,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 15:52:38,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 15:52:38,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 15:52:38,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 15:52:38,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 15:52:38,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 15:52:38,465 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 15:52:38,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 15:52:38,465 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 15:52:38,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 15:52:38,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 15:52:38,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 15:52:38,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 15:52:38,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 15:52:38,467 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 15:52:38,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 15:52:38,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 15:52:38,468 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 15:52:38,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 15:52:38,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 15:52:38,469 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 15:52:38,469 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_4431540f-5af8-489a-afa4-038be0e34dea/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_4431540f-5af8-489a-afa4-038be0e34dea/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 -> a7349305eeae716fa3a7c11218caa894d6e5121d77db0055a98af7bd7c666586 [2022-11-16 15:52:38,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 15:52:38,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 15:52:38,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 15:52:38,763 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 15:52:38,764 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 15:52:38,766 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/pthread-wmm/mix018.opt.i [2022-11-16 15:52:38,837 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/bin/utaipan-Xvt2sAort0/data/2d617165b/10bbd1ecde7d4282aa6b645a5cfa25ec/FLAG88463fdbe [2022-11-16 15:52:39,462 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 15:52:39,466 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/sv-benchmarks/c/pthread-wmm/mix018.opt.i [2022-11-16 15:52:39,482 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/bin/utaipan-Xvt2sAort0/data/2d617165b/10bbd1ecde7d4282aa6b645a5cfa25ec/FLAG88463fdbe [2022-11-16 15:52:39,687 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/bin/utaipan-Xvt2sAort0/data/2d617165b/10bbd1ecde7d4282aa6b645a5cfa25ec [2022-11-16 15:52:39,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 15:52:39,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 15:52:39,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 15:52:39,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 15:52:39,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 15:52:39,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:52:39" (1/1) ... [2022-11-16 15:52:39,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ecee989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:39, skipping insertion in model container [2022-11-16 15:52:39,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:52:39" (1/1) ... [2022-11-16 15:52:39,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 15:52:39,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 15:52:40,069 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_4431540f-5af8-489a-afa4-038be0e34dea/sv-benchmarks/c/pthread-wmm/mix018.opt.i[944,957] [2022-11-16 15:52:40,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 15:52:40,406 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 15:52:40,422 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_4431540f-5af8-489a-afa4-038be0e34dea/sv-benchmarks/c/pthread-wmm/mix018.opt.i[944,957] [2022-11-16 15:52:40,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 15:52:40,524 INFO L208 MainTranslator]: Completed translation [2022-11-16 15:52:40,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:40 WrapperNode [2022-11-16 15:52:40,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 15:52:40,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 15:52:40,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 15:52:40,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 15:52:40,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:40" (1/1) ... [2022-11-16 15:52:40,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:40" (1/1) ... [2022-11-16 15:52:40,582 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-11-16 15:52:40,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 15:52:40,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 15:52:40,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 15:52:40,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 15:52:40,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:40" (1/1) ... [2022-11-16 15:52:40,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:40" (1/1) ... [2022-11-16 15:52:40,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:40" (1/1) ... [2022-11-16 15:52:40,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:40" (1/1) ... [2022-11-16 15:52:40,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:40" (1/1) ... [2022-11-16 15:52:40,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:40" (1/1) ... [2022-11-16 15:52:40,612 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:40" (1/1) ... [2022-11-16 15:52:40,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:40" (1/1) ... [2022-11-16 15:52:40,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 15:52:40,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 15:52:40,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 15:52:40,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 15:52:40,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:40" (1/1) ... [2022-11-16 15:52:40,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 15:52:40,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 15:52:40,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 15:52:40,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 15:52:40,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 15:52:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 15:52:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 15:52:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 15:52:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 15:52:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 15:52:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 15:52:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 15:52:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 15:52:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 15:52:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 15:52:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 15:52:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 15:52:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 15:52:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 15:52:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 15:52:40,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 15:52:40,730 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 15:52:40,983 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 15:52:40,996 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 15:52:41,437 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 15:52:41,677 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 15:52:41,678 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 15:52:41,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 03:52:41 BoogieIcfgContainer [2022-11-16 15:52:41,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 15:52:41,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 15:52:41,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 15:52:41,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 15:52:41,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:52:39" (1/3) ... [2022-11-16 15:52:41,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c19cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:52:41, skipping insertion in model container [2022-11-16 15:52:41,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:40" (2/3) ... [2022-11-16 15:52:41,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c19cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:52:41, skipping insertion in model container [2022-11-16 15:52:41,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 03:52:41" (3/3) ... [2022-11-16 15:52:41,698 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018.opt.i [2022-11-16 15:52:41,709 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 15:52:41,720 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 15:52:41,721 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 15:52:41,721 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 15:52:41,814 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 15:52:41,872 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 15:52:41,891 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 135 transitions, 290 flow [2022-11-16 15:52:41,896 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 135 transitions, 290 flow [2022-11-16 15:52:41,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 290 flow [2022-11-16 15:52:41,980 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-11-16 15:52:41,980 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 15:52:41,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-11-16 15:52:41,988 INFO L119 LiptonReduction]: Number of co-enabled transitions 2934 [2022-11-16 15:52:47,677 INFO L134 LiptonReduction]: Checked pairs total: 7103 [2022-11-16 15:52:47,678 INFO L136 LiptonReduction]: Total number of compositions: 115 [2022-11-16 15:52:47,686 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2022-11-16 15:52:47,881 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2538 states, 2535 states have (on average 4.02051282051282) internal successors, (10192), 2537 states have internal predecessors, (10192), 0 states have call successors, (0), 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 15:52:47,904 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 15:52:47,912 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;@37cb378d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 15:52:47,913 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-16 15:52:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 2538 states, 2535 states have (on average 4.02051282051282) internal successors, (10192), 2537 states have internal predecessors, (10192), 0 states have call successors, (0), 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 15:52:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 15:52:47,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:47,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:52:47,936 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:47,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:47,944 INFO L85 PathProgramCache]: Analyzing trace with hash 374380121, now seen corresponding path program 1 times [2022-11-16 15:52:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:47,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623844138] [2022-11-16 15:52:47,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:47,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:52:48,544 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 15:52:48,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 15:52:48,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623844138] [2022-11-16 15:52:48,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623844138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:52:48,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:52:48,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 15:52:48,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581307690] [2022-11-16 15:52:48,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:52:48,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 15:52:48,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 15:52:48,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 15:52:48,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 15:52:48,592 INFO L87 Difference]: Start difference. First operand has 2538 states, 2535 states have (on average 4.02051282051282) internal successors, (10192), 2537 states have internal predecessors, (10192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:52:48,764 INFO L93 Difference]: Finished difference Result 2154 states and 8176 transitions. [2022-11-16 15:52:48,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 15:52:48,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 15:52:48,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:52:48,814 INFO L225 Difference]: With dead ends: 2154 [2022-11-16 15:52:48,814 INFO L226 Difference]: Without dead ends: 2090 [2022-11-16 15:52:48,815 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 15:52:48,820 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:52:48,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 15:52:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2022-11-16 15:52:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2022-11-16 15:52:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2089 states have (on average 3.814265198659646) internal successors, (7968), 2089 states have internal predecessors, (7968), 0 states have call successors, (0), 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 15:52:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7968 transitions. [2022-11-16 15:52:49,047 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7968 transitions. Word has length 9 [2022-11-16 15:52:49,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:52:49,048 INFO L495 AbstractCegarLoop]: Abstraction has 2090 states and 7968 transitions. [2022-11-16 15:52:49,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7968 transitions. [2022-11-16 15:52:49,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 15:52:49,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:49,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:52:49,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 15:52:49,063 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:49,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash -869944511, now seen corresponding path program 1 times [2022-11-16 15:52:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:49,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475621721] [2022-11-16 15:52:49,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:49,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:52:49,474 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 15:52:49,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 15:52:49,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475621721] [2022-11-16 15:52:49,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475621721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:52:49,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:52:49,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 15:52:49,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199708390] [2022-11-16 15:52:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:52:49,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:52:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 15:52:49,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:52:49,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:52:49,478 INFO L87 Difference]: Start difference. First operand 2090 states and 7968 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 15:52:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:52:49,773 INFO L93 Difference]: Finished difference Result 3614 states and 13038 transitions. [2022-11-16 15:52:49,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 15:52:49,773 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 15:52:49,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:52:49,797 INFO L225 Difference]: With dead ends: 3614 [2022-11-16 15:52:49,798 INFO L226 Difference]: Without dead ends: 2974 [2022-11-16 15:52:49,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 15:52:49,799 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 32 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 15:52:49,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 15 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 15:52:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2022-11-16 15:52:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 2606. [2022-11-16 15:52:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 2605 states have (on average 3.7166986564299425) internal successors, (9682), 2605 states have internal predecessors, (9682), 0 states have call successors, (0), 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 15:52:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 9682 transitions. [2022-11-16 15:52:49,931 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 9682 transitions. Word has length 12 [2022-11-16 15:52:49,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:52:49,932 INFO L495 AbstractCegarLoop]: Abstraction has 2606 states and 9682 transitions. [2022-11-16 15:52:49,932 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 15:52:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 9682 transitions. [2022-11-16 15:52:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 15:52:49,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:49,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:52:49,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 15:52:49,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:49,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1198453747, now seen corresponding path program 1 times [2022-11-16 15:52:49,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:49,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268539580] [2022-11-16 15:52:49,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:52:50,214 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 15:52:50,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 15:52:50,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268539580] [2022-11-16 15:52:50,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268539580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:52:50,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:52:50,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:52:50,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412538476] [2022-11-16 15:52:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:52:50,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 15:52:50,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 15:52:50,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 15:52:50,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 15:52:50,217 INFO L87 Difference]: Start difference. First operand 2606 states and 9682 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 15:52:50,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:52:50,513 INFO L93 Difference]: Finished difference Result 3086 states and 11002 transitions. [2022-11-16 15:52:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 15:52:50,514 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 15:52:50,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:52:50,531 INFO L225 Difference]: With dead ends: 3086 [2022-11-16 15:52:50,532 INFO L226 Difference]: Without dead ends: 2638 [2022-11-16 15:52:50,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 15:52:50,533 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 62 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 15:52:50,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 14 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 15:52:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2022-11-16 15:52:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2146. [2022-11-16 15:52:50,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 2145 states have (on average 3.707226107226107) internal successors, (7952), 2145 states have internal predecessors, (7952), 0 states have call successors, (0), 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 15:52:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 7952 transitions. [2022-11-16 15:52:50,633 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 7952 transitions. Word has length 13 [2022-11-16 15:52:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:52:50,633 INFO L495 AbstractCegarLoop]: Abstraction has 2146 states and 7952 transitions. [2022-11-16 15:52:50,633 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 15:52:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 7952 transitions. [2022-11-16 15:52:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 15:52:50,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:50,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:52:50,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 15:52:50,637 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:50,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1502571491, now seen corresponding path program 1 times [2022-11-16 15:52:50,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:50,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253540319] [2022-11-16 15:52:50,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:50,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:52:50,892 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 15:52:50,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 15:52:50,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253540319] [2022-11-16 15:52:50,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253540319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:52:50,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:52:50,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:52:50,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271245709] [2022-11-16 15:52:50,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:52:50,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 15:52:50,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 15:52:50,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 15:52:50,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 15:52:50,895 INFO L87 Difference]: Start difference. First operand 2146 states and 7952 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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 15:52:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:52:51,172 INFO L93 Difference]: Finished difference Result 2890 states and 10204 transitions. [2022-11-16 15:52:51,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 15:52:51,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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 15:52:51,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:52:51,188 INFO L225 Difference]: With dead ends: 2890 [2022-11-16 15:52:51,189 INFO L226 Difference]: Without dead ends: 2510 [2022-11-16 15:52:51,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 15:52:51,190 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 58 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 15:52:51,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 20 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 15:52:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2022-11-16 15:52:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2082. [2022-11-16 15:52:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2082 states, 2081 states have (on average 3.6828447861604996) internal successors, (7664), 2081 states have internal predecessors, (7664), 0 states have call successors, (0), 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 15:52:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 7664 transitions. [2022-11-16 15:52:51,267 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 7664 transitions. Word has length 14 [2022-11-16 15:52:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:52:51,267 INFO L495 AbstractCegarLoop]: Abstraction has 2082 states and 7664 transitions. [2022-11-16 15:52:51,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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 15:52:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 7664 transitions. [2022-11-16 15:52:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 15:52:51,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:51,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:52:51,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 15:52:51,271 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash -663085427, now seen corresponding path program 1 times [2022-11-16 15:52:51,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:51,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769234084] [2022-11-16 15:52:51,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:52:51,474 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 15:52:51,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 15:52:51,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769234084] [2022-11-16 15:52:51,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769234084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:52:51,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:52:51,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 15:52:51,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807039131] [2022-11-16 15:52:51,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:52:51,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 15:52:51,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 15:52:51,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 15:52:51,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 15:52:51,482 INFO L87 Difference]: Start difference. First operand 2082 states and 7664 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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 15:52:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:52:51,569 INFO L93 Difference]: Finished difference Result 1636 states and 5438 transitions. [2022-11-16 15:52:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 15:52:51,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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 15:52:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:52:51,581 INFO L225 Difference]: With dead ends: 1636 [2022-11-16 15:52:51,582 INFO L226 Difference]: Without dead ends: 1636 [2022-11-16 15:52:51,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 15:52:51,583 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:52:51,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 15:52:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2022-11-16 15:52:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2022-11-16 15:52:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1635 states have (on average 3.325993883792049) internal successors, (5438), 1635 states have internal predecessors, (5438), 0 states have call successors, (0), 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 15:52:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 5438 transitions. [2022-11-16 15:52:51,655 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 5438 transitions. Word has length 15 [2022-11-16 15:52:51,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:52:51,655 INFO L495 AbstractCegarLoop]: Abstraction has 1636 states and 5438 transitions. [2022-11-16 15:52:51,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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 15:52:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 5438 transitions. [2022-11-16 15:52:51,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 15:52:51,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:51,660 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 15:52:51,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 15:52:51,660 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1338543152, now seen corresponding path program 1 times [2022-11-16 15:52:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:51,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520068670] [2022-11-16 15:52:51,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:51,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:52:51,880 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 15:52:51,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 15:52:51,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520068670] [2022-11-16 15:52:51,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520068670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:52:51,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:52:51,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:52:51,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556517497] [2022-11-16 15:52:51,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:52:51,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:52:51,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 15:52:51,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:52:51,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:52:51,883 INFO L87 Difference]: Start difference. First operand 1636 states and 5438 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) 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 15:52:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:52:52,042 INFO L93 Difference]: Finished difference Result 2312 states and 7436 transitions. [2022-11-16 15:52:52,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 15:52:52,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) 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 15:52:52,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:52:52,057 INFO L225 Difference]: With dead ends: 2312 [2022-11-16 15:52:52,062 INFO L226 Difference]: Without dead ends: 1526 [2022-11-16 15:52:52,063 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 15:52:52,064 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:52:52,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 17 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 15:52:52,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2022-11-16 15:52:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1328. [2022-11-16 15:52:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1327 states have (on average 3.2102486812358704) internal successors, (4260), 1327 states have internal predecessors, (4260), 0 states have call successors, (0), 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 15:52:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 4260 transitions. [2022-11-16 15:52:52,108 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 4260 transitions. Word has length 17 [2022-11-16 15:52:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:52:52,108 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 4260 transitions. [2022-11-16 15:52:52,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) 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 15:52:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 4260 transitions. [2022-11-16 15:52:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 15:52:52,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:52,111 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 15:52:52,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 15:52:52,112 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:52,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2110605865, now seen corresponding path program 1 times [2022-11-16 15:52:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:52,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614924986] [2022-11-16 15:52:52,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:52,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:52:52,401 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 15:52:52,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 15:52:52,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614924986] [2022-11-16 15:52:52,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614924986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:52:52,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:52:52,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 15:52:52,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888464766] [2022-11-16 15:52:52,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:52:52,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 15:52:52,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 15:52:52,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 15:52:52,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:52:52,404 INFO L87 Difference]: Start difference. First operand 1328 states and 4260 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 15:52:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:52:52,509 INFO L93 Difference]: Finished difference Result 842 states and 2378 transitions. [2022-11-16 15:52:52,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 15:52:52,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 15:52:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:52:52,513 INFO L225 Difference]: With dead ends: 842 [2022-11-16 15:52:52,514 INFO L226 Difference]: Without dead ends: 842 [2022-11-16 15:52:52,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 15:52:52,515 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:52:52,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 9 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 15:52:52,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-11-16 15:52:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2022-11-16 15:52:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 2.8275862068965516) internal successors, (2378), 841 states have internal predecessors, (2378), 0 states have call successors, (0), 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 15:52:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2378 transitions. [2022-11-16 15:52:52,539 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 2378 transitions. Word has length 17 [2022-11-16 15:52:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:52:52,540 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 2378 transitions. [2022-11-16 15:52:52,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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 15:52:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 2378 transitions. [2022-11-16 15:52:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 15:52:52,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:52,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:52:52,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 15:52:52,543 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:52,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:52,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1020671734, now seen corresponding path program 1 times [2022-11-16 15:52:52,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:52,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383370889] [2022-11-16 15:52:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:52,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:52:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 15:52:52,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 15:52:52,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383370889] [2022-11-16 15:52:52,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383370889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:52:52,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:52:52,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:52:52,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116927865] [2022-11-16 15:52:52,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:52:52,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 15:52:52,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 15:52:52,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 15:52:52,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 15:52:52,749 INFO L87 Difference]: Start difference. First operand 842 states and 2378 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:52:52,871 INFO L93 Difference]: Finished difference Result 608 states and 1696 transitions. [2022-11-16 15:52:52,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 15:52:52,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 15:52:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:52:52,874 INFO L225 Difference]: With dead ends: 608 [2022-11-16 15:52:52,874 INFO L226 Difference]: Without dead ends: 608 [2022-11-16 15:52:52,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 15:52:52,875 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:52:52,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 12 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 15:52:52,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-11-16 15:52:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2022-11-16 15:52:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 2.7940691927512358) internal successors, (1696), 607 states have internal predecessors, (1696), 0 states have call successors, (0), 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 15:52:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1696 transitions. [2022-11-16 15:52:52,893 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1696 transitions. Word has length 20 [2022-11-16 15:52:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:52:52,893 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 1696 transitions. [2022-11-16 15:52:52,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1696 transitions. [2022-11-16 15:52:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 15:52:52,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:52,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:52:52,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 15:52:52,896 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:52,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:52,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1810466801, now seen corresponding path program 1 times [2022-11-16 15:52:52,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:52,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670356135] [2022-11-16 15:52:52,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:52,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:52:53,172 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 15:52:53,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 15:52:53,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670356135] [2022-11-16 15:52:53,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670356135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:52:53,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:52:53,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 15:52:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029584895] [2022-11-16 15:52:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:52:53,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 15:52:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 15:52:53,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 15:52:53,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 15:52:53,175 INFO L87 Difference]: Start difference. First operand 608 states and 1696 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:52:53,461 INFO L93 Difference]: Finished difference Result 892 states and 2403 transitions. [2022-11-16 15:52:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 15:52:53,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-16 15:52:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:52:53,464 INFO L225 Difference]: With dead ends: 892 [2022-11-16 15:52:53,464 INFO L226 Difference]: Without dead ends: 618 [2022-11-16 15:52:53,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 15:52:53,465 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 63 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 15:52:53,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 27 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 15:52:53,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-11-16 15:52:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 560. [2022-11-16 15:52:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 2.5688729874776386) internal successors, (1436), 559 states have internal predecessors, (1436), 0 states have call successors, (0), 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 15:52:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1436 transitions. [2022-11-16 15:52:53,481 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1436 transitions. Word has length 23 [2022-11-16 15:52:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:52:53,481 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 1436 transitions. [2022-11-16 15:52:53,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1436 transitions. [2022-11-16 15:52:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 15:52:53,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:53,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:52:53,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 15:52:53,484 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:53,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2145069857, now seen corresponding path program 2 times [2022-11-16 15:52:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:53,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896908325] [2022-11-16 15:52:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:53,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:52:53,825 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 15:52:53,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 15:52:53,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896908325] [2022-11-16 15:52:53,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896908325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:52:53,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:52:53,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 15:52:53,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372139157] [2022-11-16 15:52:53,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:52:53,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 15:52:53,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 15:52:53,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 15:52:53,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 15:52:53,827 INFO L87 Difference]: Start difference. First operand 560 states and 1436 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:52:53,962 INFO L93 Difference]: Finished difference Result 510 states and 1340 transitions. [2022-11-16 15:52:53,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 15:52:53,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-16 15:52:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:52:53,964 INFO L225 Difference]: With dead ends: 510 [2022-11-16 15:52:53,964 INFO L226 Difference]: Without dead ends: 210 [2022-11-16 15:52:53,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 15:52:53,965 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:52:53,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 10 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 15:52:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-16 15:52:53,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-11-16 15:52:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.4210526315789473) internal successors, (506), 209 states have internal predecessors, (506), 0 states have call successors, (0), 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 15:52:53,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 506 transitions. [2022-11-16 15:52:53,971 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 506 transitions. Word has length 23 [2022-11-16 15:52:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:52:53,981 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 506 transitions. [2022-11-16 15:52:53,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 506 transitions. [2022-11-16 15:52:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 15:52:53,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:53,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:52:53,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 15:52:53,983 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:53,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1278036437, now seen corresponding path program 1 times [2022-11-16 15:52:53,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:53,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387174734] [2022-11-16 15:52:53,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:52:54,264 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 15:52:54,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 15:52:54,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387174734] [2022-11-16 15:52:54,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387174734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:52:54,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:52:54,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 15:52:54,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533670066] [2022-11-16 15:52:54,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:52:54,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 15:52:54,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 15:52:54,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 15:52:54,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 15:52:54,267 INFO L87 Difference]: Start difference. First operand 210 states and 506 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:52:54,441 INFO L93 Difference]: Finished difference Result 272 states and 648 transitions. [2022-11-16 15:52:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 15:52:54,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 15:52:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:52:54,443 INFO L225 Difference]: With dead ends: 272 [2022-11-16 15:52:54,443 INFO L226 Difference]: Without dead ends: 205 [2022-11-16 15:52:54,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 15:52:54,444 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 15:52:54,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 8 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 15:52:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-16 15:52:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 170. [2022-11-16 15:52:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 2.2840236686390534) internal successors, (386), 169 states have internal predecessors, (386), 0 states have call successors, (0), 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 15:52:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 386 transitions. [2022-11-16 15:52:54,449 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 386 transitions. Word has length 26 [2022-11-16 15:52:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:52:54,450 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 386 transitions. [2022-11-16 15:52:54,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 386 transitions. [2022-11-16 15:52:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 15:52:54,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:54,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:52:54,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 15:52:54,452 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:54,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:54,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1584799063, now seen corresponding path program 2 times [2022-11-16 15:52:54,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:54,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815770021] [2022-11-16 15:52:54,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:54,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:52:54,762 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 15:52:54,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 15:52:54,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815770021] [2022-11-16 15:52:54,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815770021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:52:54,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:52:54,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 15:52:54,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027437815] [2022-11-16 15:52:54,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:52:54,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 15:52:54,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 15:52:54,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 15:52:54,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 15:52:54,765 INFO L87 Difference]: Start difference. First operand 170 states and 386 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:54,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:52:54,976 INFO L93 Difference]: Finished difference Result 238 states and 541 transitions. [2022-11-16 15:52:54,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 15:52:54,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 15:52:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:52:54,977 INFO L225 Difference]: With dead ends: 238 [2022-11-16 15:52:54,977 INFO L226 Difference]: Without dead ends: 81 [2022-11-16 15:52:54,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 15:52:54,978 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 42 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 15:52:54,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 12 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 15:52:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-16 15:52:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-16 15:52:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.0875) internal successors, (167), 80 states have internal predecessors, (167), 0 states have call successors, (0), 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 15:52:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 167 transitions. [2022-11-16 15:52:54,981 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 167 transitions. Word has length 26 [2022-11-16 15:52:54,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:52:54,981 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 167 transitions. [2022-11-16 15:52:54,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 167 transitions. [2022-11-16 15:52:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 15:52:54,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:54,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:52:54,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 15:52:54,983 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:54,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash 968847721, now seen corresponding path program 3 times [2022-11-16 15:52:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:54,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070080959] [2022-11-16 15:52:54,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 15:52:56,389 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 15:52:56,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 15:52:56,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070080959] [2022-11-16 15:52:56,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070080959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 15:52:56,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 15:52:56,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 15:52:56,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030469318] [2022-11-16 15:52:56,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 15:52:56,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 15:52:56,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 15:52:56,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 15:52:56,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 15:52:56,391 INFO L87 Difference]: Start difference. First operand 81 states and 167 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 15:52:56,711 INFO L93 Difference]: Finished difference Result 100 states and 202 transitions. [2022-11-16 15:52:56,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 15:52:56,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 15:52:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 15:52:56,713 INFO L225 Difference]: With dead ends: 100 [2022-11-16 15:52:56,713 INFO L226 Difference]: Without dead ends: 53 [2022-11-16 15:52:56,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-16 15:52:56,713 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 31 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 15:52:56,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 30 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 15:52:56,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-16 15:52:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-16 15:52:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.75) internal successors, (91), 52 states have internal predecessors, (91), 0 states have call successors, (0), 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 15:52:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 91 transitions. [2022-11-16 15:52:56,716 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 91 transitions. Word has length 26 [2022-11-16 15:52:56,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 15:52:56,716 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 91 transitions. [2022-11-16 15:52:56,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 15:52:56,716 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 91 transitions. [2022-11-16 15:52:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 15:52:56,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 15:52:56,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:52:56,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 15:52:56,717 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 15:52:56,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 15:52:56,718 INFO L85 PathProgramCache]: Analyzing trace with hash -235466997, now seen corresponding path program 4 times [2022-11-16 15:52:56,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 15:52:56,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488866702] [2022-11-16 15:52:56,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 15:52:56,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 15:52:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 15:52:56,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 15:52:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 15:52:56,898 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-16 15:52:56,899 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 15:52:56,900 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-16 15:52:56,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-16 15:52:56,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-16 15:52:56,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-16 15:52:56,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-16 15:52:56,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-16 15:52:56,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-16 15:52:56,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 15:52:56,906 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 15:52:56,913 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 15:52:56,914 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 15:52:57,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:52:57 BasicIcfg [2022-11-16 15:52:57,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 15:52:57,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 15:52:57,023 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 15:52:57,023 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 15:52:57,024 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 03:52:41" (3/4) ... [2022-11-16 15:52:57,025 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 15:52:57,148 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/bin/utaipan-Xvt2sAort0/witness.graphml [2022-11-16 15:52:57,148 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 15:52:57,149 INFO L158 Benchmark]: Toolchain (without parser) took 17456.80ms. Allocated memory was 119.5MB in the beginning and 266.3MB in the end (delta: 146.8MB). Free memory was 79.3MB in the beginning and 220.9MB in the end (delta: -141.6MB). Peak memory consumption was 156.1MB. Max. memory is 16.1GB. [2022-11-16 15:52:57,149 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 119.5MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 15:52:57,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 829.40ms. Allocated memory is still 119.5MB. Free memory was 79.1MB in the beginning and 81.5MB in the end (delta: -2.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 15:52:57,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.26ms. Allocated memory is still 119.5MB. Free memory was 81.5MB in the beginning and 79.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 15:52:57,150 INFO L158 Benchmark]: Boogie Preprocessor took 34.32ms. Allocated memory is still 119.5MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 15:52:57,153 INFO L158 Benchmark]: RCFGBuilder took 1063.63ms. Allocated memory is still 119.5MB. Free memory was 76.9MB in the beginning and 90.0MB in the end (delta: -13.1MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2022-11-16 15:52:57,153 INFO L158 Benchmark]: TraceAbstraction took 15334.99ms. Allocated memory was 119.5MB in the beginning and 266.3MB in the end (delta: 146.8MB). Free memory was 89.3MB in the beginning and 83.6MB in the end (delta: 5.8MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB. [2022-11-16 15:52:57,153 INFO L158 Benchmark]: Witness Printer took 125.40ms. Allocated memory is still 266.3MB. Free memory was 82.5MB in the beginning and 220.9MB in the end (delta: -138.4MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2022-11-16 15:52:57,159 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.36ms. Allocated memory is still 119.5MB. Free memory is still 97.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 829.40ms. Allocated memory is still 119.5MB. Free memory was 79.1MB in the beginning and 81.5MB in the end (delta: -2.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.26ms. Allocated memory is still 119.5MB. Free memory was 81.5MB in the beginning and 79.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.32ms. Allocated memory is still 119.5MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1063.63ms. Allocated memory is still 119.5MB. Free memory was 76.9MB in the beginning and 90.0MB in the end (delta: -13.1MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15334.99ms. Allocated memory was 119.5MB in the beginning and 266.3MB in the end (delta: 146.8MB). Free memory was 89.3MB in the beginning and 83.6MB in the end (delta: 5.8MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB. * Witness Printer took 125.40ms. Allocated memory is still 266.3MB. Free memory was 82.5MB in the beginning and 220.9MB in the end (delta: -138.4MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 146 PlacesBefore, 45 PlacesAfterwards, 135 TransitionsBefore, 33 TransitionsAfterwards, 2934 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, 7103 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4170, independent: 3988, independent conditional: 0, independent unconditional: 3988, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2184, independent: 2137, independent conditional: 0, independent unconditional: 2137, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2184, independent: 2111, independent conditional: 0, independent unconditional: 2111, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 341, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 293, dependent conditional: 0, dependent unconditional: 293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4170, independent: 1851, independent conditional: 0, independent unconditional: 1851, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 2184, unknown conditional: 0, unknown unconditional: 2184] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 235, Positive conditional cache size: 0, Positive unconditional cache size: 235, 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: [L740] 0 _Bool z$r_buff1_thd4; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L747] 0 _Bool weak$$choice0; [L745] 0 int z$w_buff1; [L748] 0 _Bool weak$$choice2; [L729] 0 _Bool z$flush_delayed; [L743] 0 int z$w_buff0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L712] 0 int __unbuffered_p1_EAX = 0; [L731] 0 _Bool z$r_buff0_thd0; [L718] 0 int __unbuffered_p3_EBX = 0; [L734] 0 _Bool z$r_buff0_thd3; [L730] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd4; [L741] 0 _Bool z$read_delayed; [L720] 0 int a = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L742] 0 int *z$read_delayed_var; [L746] 0 _Bool z$w_buff1_used; [L710] 0 int __unbuffered_cnt = 0; [L722] 0 _Bool main$tmp_guard1; [L721] 0 _Bool main$tmp_guard0; [L744] 0 _Bool z$w_buff0_used; [L716] 0 int __unbuffered_p3_EAX = 0; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L864] 0 pthread_t t469; [L865] FCALL, FORK 0 pthread_create(&t469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t469, ((void *)0), P0, ((void *)0))=-4, t469={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t470; [L867] FCALL, FORK 0 pthread_create(&t470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t470, ((void *)0), P1, ((void *)0))=-3, t469={5:0}, t470={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t471; [L869] FCALL, FORK 0 pthread_create(&t471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t471, ((void *)0), P2, ((void *)0))=-2, t469={5:0}, t470={6:0}, t471={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] 0 pthread_t t472; [L871] FCALL, FORK 0 pthread_create(&t472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t472, ((void *)0), P3, ((void *)0))=-1, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L782] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t469={5:0}, t470={6:0}, t471={7:0}, t472={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 169 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 595 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 595 mSDsluCounter, 186 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1442 IncrementalHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 73 mSDtfsCounter, 1442 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2606occurred in iteration=2, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 1579 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 1546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 15:52:57,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4431540f-5af8-489a-afa4-038be0e34dea/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