./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 08:26:46,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:26:46,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:26:46,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:26:46,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:26:46,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:26:46,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:26:46,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:26:46,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:26:46,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:26:46,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:26:46,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:26:46,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:26:46,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:26:46,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:26:46,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:26:46,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:26:46,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:26:46,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:26:46,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:26:46,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:26:46,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:26:46,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:26:46,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:26:46,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:26:46,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:26:46,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:26:46,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:26:46,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:26:46,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:26:46,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:26:46,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:26:46,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:26:46,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:26:46,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:26:46,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:26:46,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:26:46,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:26:46,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:26:46,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:26:46,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:26:46,466 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 08:26:46,508 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:26:46,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:26:46,509 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:26:46,510 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:26:46,510 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:26:46,511 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:26:46,511 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:26:46,511 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:26:46,511 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:26:46,512 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:26:46,513 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:26:46,513 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:26:46,513 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:26:46,513 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:26:46,514 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:26:46,514 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:26:46,514 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:26:46,514 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:26:46,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:26:46,515 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:26:46,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:26:46,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:26:46,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:26:46,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 08:26:46,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:26:46,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 08:26:46,517 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:26:46,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 08:26:46,519 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:26:46,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 08:26:46,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:26:46,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:26:46,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:26:46,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:26:46,520 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:26:46,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:26:46,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 08:26:46,521 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:26:46,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:26:46,521 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 08:26:46,522 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:26:46,522 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_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb5b5f76ea992c17ebcf5a0e506a820a4d574c4d0723905971e2f5f6725ae203 [2022-11-19 08:26:46,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:26:46,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:26:46,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:26:46,820 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:26:46,821 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:26:46,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i [2022-11-19 08:26:46,886 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/data/d7c8371c0/fddc21c3789043088ba31119fc9d946b/FLAG18740b472 [2022-11-19 08:26:47,440 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:26:47,441 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i [2022-11-19 08:26:47,455 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/data/d7c8371c0/fddc21c3789043088ba31119fc9d946b/FLAG18740b472 [2022-11-19 08:26:47,740 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/data/d7c8371c0/fddc21c3789043088ba31119fc9d946b [2022-11-19 08:26:47,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:26:47,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:26:47,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:26:47,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:26:47,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:26:47,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:26:47" (1/1) ... [2022-11-19 08:26:47,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1926dcd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:47, skipping insertion in model container [2022-11-19 08:26:47,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:26:47" (1/1) ... [2022-11-19 08:26:47,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:26:47,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:26:48,038 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i[956,969] [2022-11-19 08:26:48,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:26:48,284 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:26:48,295 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/sv-benchmarks/c/pthread-wmm/mix036_pso.opt_tso.opt.i[956,969] [2022-11-19 08:26:48,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:26:48,367 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:26:48,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:48 WrapperNode [2022-11-19 08:26:48,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:26:48,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:26:48,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:26:48,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:26:48,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:48" (1/1) ... [2022-11-19 08:26:48,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:48" (1/1) ... [2022-11-19 08:26:48,415 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2022-11-19 08:26:48,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:26:48,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:26:48,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:26:48,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:26:48,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:48" (1/1) ... [2022-11-19 08:26:48,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:48" (1/1) ... [2022-11-19 08:26:48,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:48" (1/1) ... [2022-11-19 08:26:48,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:48" (1/1) ... [2022-11-19 08:26:48,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:48" (1/1) ... [2022-11-19 08:26:48,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:48" (1/1) ... [2022-11-19 08:26:48,441 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:48" (1/1) ... [2022-11-19 08:26:48,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:48" (1/1) ... [2022-11-19 08:26:48,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:26:48,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:26:48,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:26:48,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:26:48,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:48" (1/1) ... [2022-11-19 08:26:48,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:26:48,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:26:48,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:26:48,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:26:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 08:26:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 08:26:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:26:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 08:26:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 08:26:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 08:26:48,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 08:26:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 08:26:48,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 08:26:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 08:26:48,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 08:26:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 08:26:48,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 08:26:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:26:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 08:26:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:26:48,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:26:48,550 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 08:26:48,771 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:26:48,773 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:26:49,162 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:26:49,328 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:26:49,329 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 08:26:49,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:26:49 BoogieIcfgContainer [2022-11-19 08:26:49,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:26:49,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:26:49,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:26:49,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:26:49,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:26:47" (1/3) ... [2022-11-19 08:26:49,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129f1f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:26:49, skipping insertion in model container [2022-11-19 08:26:49,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:26:48" (2/3) ... [2022-11-19 08:26:49,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129f1f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:26:49, skipping insertion in model container [2022-11-19 08:26:49,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:26:49" (3/3) ... [2022-11-19 08:26:49,352 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2022-11-19 08:26:49,361 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 08:26:49,372 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:26:49,372 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 08:26:49,372 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 08:26:49,460 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 08:26:49,504 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 08:26:49,516 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 296 flow [2022-11-19 08:26:49,519 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 296 flow [2022-11-19 08:26:49,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2022-11-19 08:26:49,582 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2022-11-19 08:26:49,582 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 08:26:49,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-19 08:26:49,590 INFO L119 LiptonReduction]: Number of co-enabled transitions 3040 [2022-11-19 08:26:55,343 INFO L134 LiptonReduction]: Checked pairs total: 7115 [2022-11-19 08:26:55,343 INFO L136 LiptonReduction]: Total number of compositions: 119 [2022-11-19 08:26:55,351 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2022-11-19 08:26:55,557 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-19 08:26:55,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:26:55,599 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;@30d2cda6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:26:55,600 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-19 08:26:55,615 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-19 08:26:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 08:26:55,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:55,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:55,627 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-19 08:26:55,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:55,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1391475950, now seen corresponding path program 1 times [2022-11-19 08:26:55,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:55,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279457358] [2022-11-19 08:26:55,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:55,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:56,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:56,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279457358] [2022-11-19 08:26:56,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279457358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:56,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:56,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 08:26:56,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549683763] [2022-11-19 08:26:56,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:56,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:26:56,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:56,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:26:56,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:26:56,340 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-19 08:26:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:56,516 INFO L93 Difference]: Finished difference Result 2154 states and 8176 transitions. [2022-11-19 08:26:56,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:26:56,519 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-19 08:26:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:56,560 INFO L225 Difference]: With dead ends: 2154 [2022-11-19 08:26:56,560 INFO L226 Difference]: Without dead ends: 2090 [2022-11-19 08:26:56,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:26:56,565 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:56,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:26:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2022-11-19 08:26:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2022-11-19 08:26:56,726 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-19 08:26:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7968 transitions. [2022-11-19 08:26:56,745 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7968 transitions. Word has length 9 [2022-11-19 08:26:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:56,747 INFO L495 AbstractCegarLoop]: Abstraction has 2090 states and 7968 transitions. [2022-11-19 08:26:56,747 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-19 08:26:56,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7968 transitions. [2022-11-19 08:26:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 08:26:56,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:56,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:56,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:26:56,752 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-19 08:26:56,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:56,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1566181088, now seen corresponding path program 1 times [2022-11-19 08:26:56,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:56,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505944885] [2022-11-19 08:26:56,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:56,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:57,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:57,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505944885] [2022-11-19 08:26:57,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505944885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:57,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:57,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:26:57,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145010966] [2022-11-19 08:26:57,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:57,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:26:57,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:57,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:26:57,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:26:57,226 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-19 08:26:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:57,457 INFO L93 Difference]: Finished difference Result 2442 states and 9008 transitions. [2022-11-19 08:26:57,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:26:57,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 08:26:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:57,475 INFO L225 Difference]: With dead ends: 2442 [2022-11-19 08:26:57,476 INFO L226 Difference]: Without dead ends: 2058 [2022-11-19 08:26:57,476 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-19 08:26:57,478 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:57,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 12 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:26:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2022-11-19 08:26:57,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058. [2022-11-19 08:26:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 2057 states have (on average 3.795819154107924) internal successors, (7808), 2057 states have internal predecessors, (7808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 7808 transitions. [2022-11-19 08:26:57,636 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 7808 transitions. Word has length 12 [2022-11-19 08:26:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:57,636 INFO L495 AbstractCegarLoop]: Abstraction has 2058 states and 7808 transitions. [2022-11-19 08:26:57,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 7808 transitions. [2022-11-19 08:26:57,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:26:57,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:57,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:57,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 08:26:57,650 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-19 08:26:57,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2117206089, now seen corresponding path program 1 times [2022-11-19 08:26:57,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:57,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679372585] [2022-11-19 08:26:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:57,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:58,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:58,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679372585] [2022-11-19 08:26:58,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679372585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:58,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:58,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:26:58,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389743929] [2022-11-19 08:26:58,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:58,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:26:58,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:58,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:26:58,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:26:58,004 INFO L87 Difference]: Start difference. First operand 2058 states and 7808 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-19 08:26:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:58,199 INFO L93 Difference]: Finished difference Result 2170 states and 7992 transitions. [2022-11-19 08:26:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:26:58,199 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-19 08:26:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:58,216 INFO L225 Difference]: With dead ends: 2170 [2022-11-19 08:26:58,216 INFO L226 Difference]: Without dead ends: 1834 [2022-11-19 08:26:58,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:26:58,218 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 52 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:58,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 12 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:26:58,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2022-11-19 08:26:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1834. [2022-11-19 08:26:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1833 states have (on average 3.7534097108565194) internal successors, (6880), 1833 states have internal predecessors, (6880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 6880 transitions. [2022-11-19 08:26:58,343 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 6880 transitions. Word has length 14 [2022-11-19 08:26:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:58,343 INFO L495 AbstractCegarLoop]: Abstraction has 1834 states and 6880 transitions. [2022-11-19 08:26:58,344 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-19 08:26:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 6880 transitions. [2022-11-19 08:26:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 08:26:58,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:58,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:58,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 08:26:58,348 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-19 08:26:58,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:58,349 INFO L85 PathProgramCache]: Analyzing trace with hash 989206187, now seen corresponding path program 1 times [2022-11-19 08:26:58,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:58,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432729982] [2022-11-19 08:26:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:58,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:58,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:58,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432729982] [2022-11-19 08:26:58,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432729982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:58,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:58,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:26:58,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608500887] [2022-11-19 08:26:58,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:58,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:26:58,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:58,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:26:58,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:26:58,562 INFO L87 Difference]: Start difference. First operand 1834 states and 6880 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:58,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:58,687 INFO L93 Difference]: Finished difference Result 1402 states and 4720 transitions. [2022-11-19 08:26:58,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:26:58,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 08:26:58,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:58,698 INFO L225 Difference]: With dead ends: 1402 [2022-11-19 08:26:58,698 INFO L226 Difference]: Without dead ends: 1402 [2022-11-19 08:26:58,699 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-19 08:26:58,700 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:58,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:26:58,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2022-11-19 08:26:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2022-11-19 08:26:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1401 states have (on average 3.3690221270521055) internal successors, (4720), 1401 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 4720 transitions. [2022-11-19 08:26:58,757 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 4720 transitions. Word has length 14 [2022-11-19 08:26:58,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:58,757 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 4720 transitions. [2022-11-19 08:26:58,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 4720 transitions. [2022-11-19 08:26:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 08:26:58,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:58,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:58,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 08:26:58,761 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-19 08:26:58,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:58,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1305431448, now seen corresponding path program 1 times [2022-11-19 08:26:58,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:58,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687688760] [2022-11-19 08:26:58,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:58,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:58,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:58,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:58,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687688760] [2022-11-19 08:26:58,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687688760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:58,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:58,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:26:58,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847150529] [2022-11-19 08:26:58,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:58,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 08:26:58,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:58,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 08:26:58,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:26:58,937 INFO L87 Difference]: Start difference. First operand 1402 states and 4720 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-19 08:26:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:59,086 INFO L93 Difference]: Finished difference Result 862 states and 2560 transitions. [2022-11-19 08:26:59,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 08:26:59,087 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-19 08:26:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:59,093 INFO L225 Difference]: With dead ends: 862 [2022-11-19 08:26:59,093 INFO L226 Difference]: Without dead ends: 862 [2022-11-19 08:26:59,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 08:26:59,095 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:59,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:26:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2022-11-19 08:26:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2022-11-19 08:26:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 861 states have (on average 2.9732868757259) internal successors, (2560), 861 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 2560 transitions. [2022-11-19 08:26:59,138 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 2560 transitions. Word has length 17 [2022-11-19 08:26:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:59,138 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 2560 transitions. [2022-11-19 08:26:59,139 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-19 08:26:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 2560 transitions. [2022-11-19 08:26:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 08:26:59,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:59,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:26:59,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 08:26:59,144 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-19 08:26:59,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:59,145 INFO L85 PathProgramCache]: Analyzing trace with hash 580434171, now seen corresponding path program 1 times [2022-11-19 08:26:59,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:59,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726027463] [2022-11-19 08:26:59,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:59,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:59,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:59,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726027463] [2022-11-19 08:26:59,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726027463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:59,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:59,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:26:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786030005] [2022-11-19 08:26:59,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:59,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:26:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:59,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:26:59,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:26:59,373 INFO L87 Difference]: Start difference. First operand 862 states and 2560 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-19 08:26:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:26:59,524 INFO L93 Difference]: Finished difference Result 610 states and 1804 transitions. [2022-11-19 08:26:59,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:26:59,524 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-19 08:26:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:26:59,529 INFO L225 Difference]: With dead ends: 610 [2022-11-19 08:26:59,529 INFO L226 Difference]: Without dead ends: 610 [2022-11-19 08:26:59,530 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-19 08:26:59,530 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:26:59,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 16 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:26:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-19 08:26:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2022-11-19 08:26:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 2.962233169129721) internal successors, (1804), 609 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:26:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1804 transitions. [2022-11-19 08:26:59,569 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1804 transitions. Word has length 20 [2022-11-19 08:26:59,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:26:59,570 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 1804 transitions. [2022-11-19 08:26:59,570 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-19 08:26:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1804 transitions. [2022-11-19 08:26:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 08:26:59,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:26:59,573 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-19 08:26:59,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 08:26:59,574 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-19 08:26:59,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:26:59,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1671254838, now seen corresponding path program 1 times [2022-11-19 08:26:59,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:26:59,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445081795] [2022-11-19 08:26:59,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:26:59,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:26:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:26:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:26:59,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:26:59,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445081795] [2022-11-19 08:26:59,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445081795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:26:59,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:26:59,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:26:59,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395699729] [2022-11-19 08:26:59,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:26:59,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:26:59,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:26:59,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:26:59,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:26:59,882 INFO L87 Difference]: Start difference. First operand 610 states and 1804 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-19 08:27:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:00,042 INFO L93 Difference]: Finished difference Result 558 states and 1700 transitions. [2022-11-19 08:27:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:27:00,043 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-19 08:27:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:00,047 INFO L225 Difference]: With dead ends: 558 [2022-11-19 08:27:00,047 INFO L226 Difference]: Without dead ends: 558 [2022-11-19 08:27:00,047 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-19 08:27:00,048 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 99 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:00,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 16 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:27:00,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-11-19 08:27:00,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2022-11-19 08:27:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 3.0520646319569122) internal successors, (1700), 557 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1700 transitions. [2022-11-19 08:27:00,071 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1700 transitions. Word has length 23 [2022-11-19 08:27:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:00,071 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 1700 transitions. [2022-11-19 08:27:00,071 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-19 08:27:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1700 transitions. [2022-11-19 08:27:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 08:27:00,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:00,074 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-19 08:27:00,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 08:27:00,075 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-19 08:27:00,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash 433753767, now seen corresponding path program 1 times [2022-11-19 08:27:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:00,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870040675] [2022-11-19 08:27:00,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:00,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:27:00,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:00,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870040675] [2022-11-19 08:27:00,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870040675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:00,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:27:00,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:27:00,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537650468] [2022-11-19 08:27:00,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:00,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:27:00,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:00,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:27:00,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:27:00,409 INFO L87 Difference]: Start difference. First operand 558 states and 1700 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-19 08:27:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:00,588 INFO L93 Difference]: Finished difference Result 705 states and 2111 transitions. [2022-11-19 08:27:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 08:27:00,589 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-19 08:27:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:00,592 INFO L225 Difference]: With dead ends: 705 [2022-11-19 08:27:00,592 INFO L226 Difference]: Without dead ends: 288 [2022-11-19 08:27:00,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:27:00,593 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:00,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 23 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 08:27:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-19 08:27:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-11-19 08:27:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.724738675958188) internal successors, (782), 287 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 782 transitions. [2022-11-19 08:27:00,604 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 782 transitions. Word has length 26 [2022-11-19 08:27:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:00,605 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 782 transitions. [2022-11-19 08:27:00,605 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-19 08:27:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 782 transitions. [2022-11-19 08:27:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 08:27:00,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:00,607 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-19 08:27:00,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 08:27:00,607 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-19 08:27:00,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:00,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1896494413, now seen corresponding path program 2 times [2022-11-19 08:27:00,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:00,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133885940] [2022-11-19 08:27:00,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:27:00,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:00,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133885940] [2022-11-19 08:27:00,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133885940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:00,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:27:00,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 08:27:00,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542281446] [2022-11-19 08:27:00,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:00,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 08:27:00,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:00,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 08:27:00,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 08:27:00,936 INFO L87 Difference]: Start difference. First operand 288 states and 782 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-19 08:27:01,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:01,136 INFO L93 Difference]: Finished difference Result 363 states and 971 transitions. [2022-11-19 08:27:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:27:01,137 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-19 08:27:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:01,139 INFO L225 Difference]: With dead ends: 363 [2022-11-19 08:27:01,139 INFO L226 Difference]: Without dead ends: 292 [2022-11-19 08:27:01,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-19 08:27:01,140 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:01,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 14 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:27:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-19 08:27:01,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 244. [2022-11-19 08:27:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.6090534979423867) internal successors, (634), 243 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 634 transitions. [2022-11-19 08:27:01,150 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 634 transitions. Word has length 26 [2022-11-19 08:27:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:01,151 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 634 transitions. [2022-11-19 08:27:01,151 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-19 08:27:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 634 transitions. [2022-11-19 08:27:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 08:27:01,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:01,153 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-19 08:27:01,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 08:27:01,153 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-19 08:27:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash -682605979, now seen corresponding path program 3 times [2022-11-19 08:27:01,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:01,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77252367] [2022-11-19 08:27:01,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:01,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:01,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:27:01,455 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:01,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77252367] [2022-11-19 08:27:01,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77252367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:01,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:27:01,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:27:01,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335901097] [2022-11-19 08:27:01,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:01,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:27:01,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:01,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:27:01,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:27:01,458 INFO L87 Difference]: Start difference. First operand 244 states and 634 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-19 08:27:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:01,671 INFO L93 Difference]: Finished difference Result 319 states and 823 transitions. [2022-11-19 08:27:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:27:01,672 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-19 08:27:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:01,674 INFO L225 Difference]: With dead ends: 319 [2022-11-19 08:27:01,674 INFO L226 Difference]: Without dead ends: 150 [2022-11-19 08:27:01,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-19 08:27:01,675 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 39 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:01,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 16 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:27:01,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-19 08:27:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-19 08:27:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.4093959731543624) internal successors, (359), 149 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 359 transitions. [2022-11-19 08:27:01,681 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 359 transitions. Word has length 26 [2022-11-19 08:27:01,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:01,681 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 359 transitions. [2022-11-19 08:27:01,681 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-19 08:27:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 359 transitions. [2022-11-19 08:27:01,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 08:27:01,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:01,683 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-19 08:27:01,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 08:27:01,685 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-19 08:27:01,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1940231867, now seen corresponding path program 4 times [2022-11-19 08:27:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:01,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651914095] [2022-11-19 08:27:01,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:27:03,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:03,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651914095] [2022-11-19 08:27:03,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651914095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:03,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:27:03,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 08:27:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437982918] [2022-11-19 08:27:03,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:03,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-19 08:27:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:03,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-19 08:27:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-19 08:27:03,510 INFO L87 Difference]: Start difference. First operand 150 states and 359 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-19 08:27:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:04,033 INFO L93 Difference]: Finished difference Result 273 states and 660 transitions. [2022-11-19 08:27:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 08:27:04,033 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-19 08:27:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:04,035 INFO L225 Difference]: With dead ends: 273 [2022-11-19 08:27:04,035 INFO L226 Difference]: Without dead ends: 141 [2022-11-19 08:27:04,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-19 08:27:04,036 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:04,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 69 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 08:27:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-19 08:27:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-11-19 08:27:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.4357142857142855) internal successors, (341), 140 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 341 transitions. [2022-11-19 08:27:04,042 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 341 transitions. Word has length 26 [2022-11-19 08:27:04,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:04,042 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 341 transitions. [2022-11-19 08:27:04,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-19 08:27:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 341 transitions. [2022-11-19 08:27:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 08:27:04,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:04,044 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-19 08:27:04,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 08:27:04,044 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-19 08:27:04,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:04,045 INFO L85 PathProgramCache]: Analyzing trace with hash 119908527, now seen corresponding path program 5 times [2022-11-19 08:27:04,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:04,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735862013] [2022-11-19 08:27:04,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:04,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:27:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:27:05,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:27:05,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735862013] [2022-11-19 08:27:05,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735862013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:27:05,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:27:05,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 08:27:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996693143] [2022-11-19 08:27:05,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:27:05,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:27:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:27:05,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:27:05,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:27:05,276 INFO L87 Difference]: Start difference. First operand 141 states and 341 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:27:05,595 INFO L93 Difference]: Finished difference Result 184 states and 432 transitions. [2022-11-19 08:27:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 08:27:05,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-19 08:27:05,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:27:05,597 INFO L225 Difference]: With dead ends: 184 [2022-11-19 08:27:05,597 INFO L226 Difference]: Without dead ends: 101 [2022-11-19 08:27:05,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-19 08:27:05,598 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 49 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:27:05,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 30 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 08:27:05,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-19 08:27:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-19 08:27:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.13) internal successors, (213), 100 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 213 transitions. [2022-11-19 08:27:05,602 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 213 transitions. Word has length 26 [2022-11-19 08:27:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:27:05,603 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 213 transitions. [2022-11-19 08:27:05,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:27:05,606 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 213 transitions. [2022-11-19 08:27:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 08:27:05,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:27:05,610 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-19 08:27:05,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 08:27:05,611 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-19 08:27:05,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:27:05,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1850487905, now seen corresponding path program 6 times [2022-11-19 08:27:05,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:27:05,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038962352] [2022-11-19 08:27:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:27:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:27:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:27:05,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 08:27:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:27:05,778 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 08:27:05,779 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 08:27:05,780 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-19 08:27:05,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-19 08:27:05,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-19 08:27:05,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-19 08:27:05,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-19 08:27:05,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-19 08:27:05,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-19 08:27:05,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 08:27:05,787 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:27:05,794 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 08:27:05,794 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 08:27:05,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:27:05 BasicIcfg [2022-11-19 08:27:05,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 08:27:05,946 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 08:27:05,946 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 08:27:05,947 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 08:27:05,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:26:49" (3/4) ... [2022-11-19 08:27:05,950 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 08:27:06,110 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 08:27:06,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 08:27:06,112 INFO L158 Benchmark]: Toolchain (without parser) took 18368.71ms. Allocated memory was 100.7MB in the beginning and 272.6MB in the end (delta: 172.0MB). Free memory was 67.5MB in the beginning and 139.0MB in the end (delta: -71.4MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. [2022-11-19 08:27:06,112 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 100.7MB. Free memory was 54.3MB in the beginning and 54.2MB in the end (delta: 41.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:27:06,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.23ms. Allocated memory is still 100.7MB. Free memory was 67.3MB in the beginning and 62.7MB in the end (delta: 4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 08:27:06,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.90ms. Allocated memory is still 100.7MB. Free memory was 62.3MB in the beginning and 59.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:27:06,114 INFO L158 Benchmark]: Boogie Preprocessor took 29.70ms. Allocated memory is still 100.7MB. Free memory was 59.8MB in the beginning and 58.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:27:06,115 INFO L158 Benchmark]: RCFGBuilder took 886.06ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 58.1MB in the beginning and 83.6MB in the end (delta: -25.5MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2022-11-19 08:27:06,118 INFO L158 Benchmark]: TraceAbstraction took 16611.17ms. Allocated memory was 123.7MB in the beginning and 272.6MB in the end (delta: 148.9MB). Free memory was 82.6MB in the beginning and 154.7MB in the end (delta: -72.1MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. [2022-11-19 08:27:06,119 INFO L158 Benchmark]: Witness Printer took 164.81ms. Allocated memory is still 272.6MB. Free memory was 154.7MB in the beginning and 139.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-19 08:27:06,121 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.23ms. Allocated memory is still 100.7MB. Free memory was 54.3MB in the beginning and 54.2MB in the end (delta: 41.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.23ms. Allocated memory is still 100.7MB. Free memory was 67.3MB in the beginning and 62.7MB in the end (delta: 4.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.90ms. Allocated memory is still 100.7MB. Free memory was 62.3MB in the beginning and 59.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.70ms. Allocated memory is still 100.7MB. Free memory was 59.8MB in the beginning and 58.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 886.06ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 58.1MB in the beginning and 83.6MB in the end (delta: -25.5MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16611.17ms. Allocated memory was 123.7MB in the beginning and 272.6MB in the end (delta: 148.9MB). Free memory was 82.6MB in the beginning and 154.7MB in the end (delta: -72.1MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. * Witness Printer took 164.81ms. Allocated memory is still 272.6MB. Free memory was 154.7MB in the beginning and 139.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.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, 149 PlacesBefore, 45 PlacesAfterwards, 138 TransitionsBefore, 33 TransitionsAfterwards, 3040 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 7115 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4277, independent: 4094, independent conditional: 0, independent unconditional: 4094, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2156, independent: 2107, independent conditional: 0, independent unconditional: 2107, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2156, independent: 2078, independent conditional: 0, independent unconditional: 2078, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 324, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4277, independent: 1987, independent conditional: 0, independent unconditional: 1987, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 2156, unknown conditional: 0, unknown unconditional: 2156] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 210, Positive conditional cache size: 0, Positive unconditional cache size: 210, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L744] 0 _Bool z$r_buff1_thd4; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L751] 0 _Bool weak$$choice0; [L749] 0 int z$w_buff1; [L752] 0 _Bool weak$$choice2; [L712] 0 int __unbuffered_p0_EAX = 0; [L733] 0 _Bool z$flush_delayed; [L747] 0 int z$w_buff0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L714] 0 int __unbuffered_p1_EAX = 0; [L735] 0 _Bool z$r_buff0_thd0; [L720] 0 int __unbuffered_p3_EBX = 0; [L738] 0 _Bool z$r_buff0_thd3; [L734] 0 int z$mem_tmp; [L739] 0 _Bool z$r_buff0_thd4; [L745] 0 _Bool z$read_delayed; [L722] 0 int a = 0; [L724] 0 int b = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L746] 0 int *z$read_delayed_var; [L750] 0 _Bool z$w_buff1_used; [L710] 0 int __unbuffered_cnt = 0; [L726] 0 _Bool main$tmp_guard1; [L725] 0 _Bool main$tmp_guard0; [L748] 0 _Bool z$w_buff0_used; [L718] 0 int __unbuffered_p3_EAX = 0; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t949, ((void *)0), P0, ((void *)0))=-2, t949={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] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t950, ((void *)0), P1, ((void *)0))=-1, t949={5:0}, t950={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] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t951, ((void *)0), P2, ((void *)0))=0, t949={5:0}, t950={6:0}, t951={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] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t952, ((void *)0), P3, ((void *)0))=1, t949={5:0}, t950={6:0}, t951={7:0}, t952={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] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=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] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=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] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=1, 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] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=1, 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] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L774] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L786] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 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) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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] [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L836] 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) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 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 [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 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 [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 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_p0_EAX=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}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, 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] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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: 861]: 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: 863]: 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: 859]: 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, 173 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 460 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 460 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1358 IncrementalHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 75 mSDtfsCounter, 1358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2538occurred in iteration=0, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 48 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 1777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-19 08:27:06,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f283557-71c3-4adb-918f-2e9a6bdb28ec/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE