./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:09:41,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:09:41,389 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 15:09:41,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:09:41,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:09:41,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:09:41,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:09:41,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:09:41,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:09:41,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:09:41,421 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:09:41,422 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:09:41,422 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:09:41,423 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:09:41,423 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:09:41,424 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:09:41,424 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:09:41,425 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:09:41,425 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:09:41,426 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:09:41,426 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:09:41,431 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:09:41,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:09:41,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:09:41,433 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:09:41,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:09:41,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:09:41,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:09:41,435 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:09:41,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:09:41,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:09:41,436 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:09:41,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:09:41,437 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:09:41,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:09:41,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:09:41,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:09:41,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:09:41,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:09:41,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:09:41,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:09:41,439 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:09:41,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:09:41,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:09:41,439 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:09:41,439 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:09:41,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:09:41,440 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/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_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 [2023-12-02 15:09:41,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:09:41,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:09:41,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:09:41,703 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:09:41,703 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:09:41,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2023-12-02 15:09:44,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:09:44,782 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:09:44,782 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2023-12-02 15:09:44,798 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/data/ad16dc22f/90b547eed51844b88d0af23484793257/FLAGddc284fb7 [2023-12-02 15:09:44,811 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/data/ad16dc22f/90b547eed51844b88d0af23484793257 [2023-12-02 15:09:44,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:09:44,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:09:44,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:09:44,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:09:44,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:09:44,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:09:44" (1/1) ... [2023-12-02 15:09:44,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f4b1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:44, skipping insertion in model container [2023-12-02 15:09:44,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:09:44" (1/1) ... [2023-12-02 15:09:44,870 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:09:45,009 WARN L240 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_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2023-12-02 15:09:45,183 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:09:45,194 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:09:45,203 WARN L240 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_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2023-12-02 15:09:45,262 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:09:45,291 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:09:45,291 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:09:45,297 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:09:45,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:45 WrapperNode [2023-12-02 15:09:45,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:09:45,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:09:45,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:09:45,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:09:45,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:45" (1/1) ... [2023-12-02 15:09:45,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:45" (1/1) ... [2023-12-02 15:09:45,350 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-12-02 15:09:45,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:09:45,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:09:45,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:09:45,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:09:45,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:45" (1/1) ... [2023-12-02 15:09:45,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:45" (1/1) ... [2023-12-02 15:09:45,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:45" (1/1) ... [2023-12-02 15:09:45,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:45" (1/1) ... [2023-12-02 15:09:45,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:45" (1/1) ... [2023-12-02 15:09:45,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:45" (1/1) ... [2023-12-02 15:09:45,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:45" (1/1) ... [2023-12-02 15:09:45,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:45" (1/1) ... [2023-12-02 15:09:45,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:09:45,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:09:45,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:09:45,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:09:45,395 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:45" (1/1) ... [2023-12-02 15:09:45,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:09:45,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:09:45,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:09:45,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:09:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 15:09:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 15:09:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:09:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:09:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:09:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 15:09:45,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 15:09:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 15:09:45,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 15:09:45,469 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-02 15:09:45,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-02 15:09:45,470 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-02 15:09:45,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-02 15:09:45,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:09:45,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 15:09:45,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:09:45,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:09:45,472 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 15:09:45,616 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:09:45,618 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:09:45,982 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:09:46,150 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:09:46,150 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 15:09:46,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:09:46 BoogieIcfgContainer [2023-12-02 15:09:46,151 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:09:46,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:09:46,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:09:46,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:09:46,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:09:44" (1/3) ... [2023-12-02 15:09:46,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3667f641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:09:46, skipping insertion in model container [2023-12-02 15:09:46,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:09:45" (2/3) ... [2023-12-02 15:09:46,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3667f641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:09:46, skipping insertion in model container [2023-12-02 15:09:46,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:09:46" (3/3) ... [2023-12-02 15:09:46,160 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2023-12-02 15:09:46,169 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 15:09:46,179 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:09:46,180 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 15:09:46,180 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 15:09:46,228 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 15:09:46,254 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 50 transitions, 116 flow [2023-12-02 15:09:47,486 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35310 states, 35307 states have (on average 4.37397683178973) internal successors, (154432), 35309 states have internal predecessors, (154432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:47,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:09:47,510 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=LoopHeads, 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;@650e751e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:09:47,511 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-02 15:09:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 35310 states, 35307 states have (on average 4.37397683178973) internal successors, (154432), 35309 states have internal predecessors, (154432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:09:47,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:09:47,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:09:47,674 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:09:47,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:09:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash -974752949, now seen corresponding path program 1 times [2023-12-02 15:09:47,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:09:47,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835792710] [2023-12-02 15:09:47,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:09:47,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:09:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:09:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:09:48,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:09:48,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835792710] [2023-12-02 15:09:48,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835792710] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:09:48,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:09:48,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 15:09:48,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451113895] [2023-12-02 15:09:48,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:09:48,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:09:48,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:09:48,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:09:48,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:09:48,360 INFO L87 Difference]: Start difference. First operand has 35310 states, 35307 states have (on average 4.37397683178973) internal successors, (154432), 35309 states have internal predecessors, (154432), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:09:49,234 INFO L93 Difference]: Finished difference Result 30347 states and 130816 transitions. [2023-12-02 15:09:49,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:09:49,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-12-02 15:09:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:09:49,698 INFO L225 Difference]: With dead ends: 30347 [2023-12-02 15:09:49,698 INFO L226 Difference]: Without dead ends: 28583 [2023-12-02 15:09:49,699 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 [2023-12-02 15:09:49,703 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:09:49,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 40 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:09:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28583 states. [2023-12-02 15:09:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28583 to 28583. [2023-12-02 15:09:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28583 states, 28582 states have (on average 4.323630256804982) internal successors, (123578), 28582 states have internal predecessors, (123578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28583 states to 28583 states and 123578 transitions. [2023-12-02 15:09:51,264 INFO L78 Accepts]: Start accepts. Automaton has 28583 states and 123578 transitions. Word has length 6 [2023-12-02 15:09:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:09:51,264 INFO L495 AbstractCegarLoop]: Abstraction has 28583 states and 123578 transitions. [2023-12-02 15:09:51,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 28583 states and 123578 transitions. [2023-12-02 15:09:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 15:09:51,281 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:09:51,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:09:51,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:09:51,281 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:09:51,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:09:51,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1375947326, now seen corresponding path program 1 times [2023-12-02 15:09:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:09:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44028697] [2023-12-02 15:09:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:09:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:09:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:09:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:09:51,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:09:51,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44028697] [2023-12-02 15:09:51,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44028697] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:09:51,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:09:51,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:09:51,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303276530] [2023-12-02 15:09:51,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:09:51,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:09:51,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:09:51,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:09:51,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:09:51,798 INFO L87 Difference]: Start difference. First operand 28583 states and 123578 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:09:52,413 INFO L93 Difference]: Finished difference Result 29269 states and 124313 transitions. [2023-12-02 15:09:52,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:09:52,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 15:09:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:09:52,579 INFO L225 Difference]: With dead ends: 29269 [2023-12-02 15:09:52,580 INFO L226 Difference]: Without dead ends: 23095 [2023-12-02 15:09:52,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:09:52,582 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 113 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:09:52,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 152 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:09:52,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23095 states. [2023-12-02 15:09:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23095 to 23095. [2023-12-02 15:09:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23095 states, 23094 states have (on average 4.264744089373863) internal successors, (98490), 23094 states have internal predecessors, (98490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23095 states to 23095 states and 98490 transitions. [2023-12-02 15:09:53,655 INFO L78 Accepts]: Start accepts. Automaton has 23095 states and 98490 transitions. Word has length 16 [2023-12-02 15:09:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:09:53,657 INFO L495 AbstractCegarLoop]: Abstraction has 23095 states and 98490 transitions. [2023-12-02 15:09:53,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 23095 states and 98490 transitions. [2023-12-02 15:09:53,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 15:09:53,684 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:09:53,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:09:53,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:09:53,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:09:53,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:09:53,685 INFO L85 PathProgramCache]: Analyzing trace with hash -793310080, now seen corresponding path program 1 times [2023-12-02 15:09:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:09:53,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506261125] [2023-12-02 15:09:53,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:09:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:09:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:09:54,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:09:54,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:09:54,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506261125] [2023-12-02 15:09:54,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506261125] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:09:54,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:09:54,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:09:54,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199709248] [2023-12-02 15:09:54,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:09:54,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:09:54,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:09:54,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:09:54,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:09:54,415 INFO L87 Difference]: Start difference. First operand 23095 states and 98490 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:09:54,920 INFO L93 Difference]: Finished difference Result 25685 states and 108067 transitions. [2023-12-02 15:09:54,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:09:54,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 15:09:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:09:55,158 INFO L225 Difference]: With dead ends: 25685 [2023-12-02 15:09:55,158 INFO L226 Difference]: Without dead ends: 22255 [2023-12-02 15:09:55,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:09:55,160 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 88 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:09:55,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 184 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:09:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22255 states. [2023-12-02 15:09:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22255 to 22255. [2023-12-02 15:09:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22255 states, 22254 states have (on average 4.249932596387167) internal successors, (94578), 22254 states have internal predecessors, (94578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22255 states to 22255 states and 94578 transitions. [2023-12-02 15:09:55,987 INFO L78 Accepts]: Start accepts. Automaton has 22255 states and 94578 transitions. Word has length 20 [2023-12-02 15:09:55,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:09:55,988 INFO L495 AbstractCegarLoop]: Abstraction has 22255 states and 94578 transitions. [2023-12-02 15:09:55,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 22255 states and 94578 transitions. [2023-12-02 15:09:56,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 15:09:56,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:09:56,021 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] [2023-12-02 15:09:56,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 15:09:56,021 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:09:56,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:09:56,022 INFO L85 PathProgramCache]: Analyzing trace with hash 732826498, now seen corresponding path program 1 times [2023-12-02 15:09:56,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:09:56,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306124297] [2023-12-02 15:09:56,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:09:56,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:09:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:09:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:09:56,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:09:56,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306124297] [2023-12-02 15:09:56,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306124297] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:09:56,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:09:56,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:09:56,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441117787] [2023-12-02 15:09:56,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:09:56,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:09:56,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:09:56,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:09:56,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:09:56,941 INFO L87 Difference]: Start difference. First operand 22255 states and 94578 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:09:57,507 INFO L93 Difference]: Finished difference Result 24513 states and 103011 transitions. [2023-12-02 15:09:57,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:09:57,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2023-12-02 15:09:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:09:57,609 INFO L225 Difference]: With dead ends: 24513 [2023-12-02 15:09:57,609 INFO L226 Difference]: Without dead ends: 22063 [2023-12-02 15:09:57,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:09:57,611 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 109 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:09:57,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 218 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:09:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22063 states. [2023-12-02 15:09:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22063 to 22063. [2023-12-02 15:09:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22063 states, 22062 states have (on average 4.243404949687245) internal successors, (93618), 22062 states have internal predecessors, (93618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22063 states to 22063 states and 93618 transitions. [2023-12-02 15:09:58,485 INFO L78 Accepts]: Start accepts. Automaton has 22063 states and 93618 transitions. Word has length 22 [2023-12-02 15:09:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:09:58,486 INFO L495 AbstractCegarLoop]: Abstraction has 22063 states and 93618 transitions. [2023-12-02 15:09:58,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 22063 states and 93618 transitions. [2023-12-02 15:09:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 15:09:58,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:09:58,509 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] [2023-12-02 15:09:58,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 15:09:58,509 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:09:58,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:09:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash -314961353, now seen corresponding path program 1 times [2023-12-02 15:09:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:09:58,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787481035] [2023-12-02 15:09:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:09:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:09:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:09:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:09:59,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:09:59,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787481035] [2023-12-02 15:09:59,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787481035] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:09:59,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:09:59,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:09:59,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165842257] [2023-12-02 15:09:59,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:09:59,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:09:59,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:09:59,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:09:59,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:09:59,212 INFO L87 Difference]: Start difference. First operand 22063 states and 93618 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:09:59,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:09:59,997 INFO L93 Difference]: Finished difference Result 24469 states and 102940 transitions. [2023-12-02 15:09:59,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 15:09:59,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 15:09:59,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:00,121 INFO L225 Difference]: With dead ends: 24469 [2023-12-02 15:10:00,121 INFO L226 Difference]: Without dead ends: 22401 [2023-12-02 15:10:00,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:10:00,123 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 164 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:00,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 257 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:10:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22401 states. [2023-12-02 15:10:01,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22401 to 22401. [2023-12-02 15:10:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22401 states, 22400 states have (on average 4.243482142857143) internal successors, (95054), 22400 states have internal predecessors, (95054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22401 states to 22401 states and 95054 transitions. [2023-12-02 15:10:01,108 INFO L78 Accepts]: Start accepts. Automaton has 22401 states and 95054 transitions. Word has length 23 [2023-12-02 15:10:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:01,108 INFO L495 AbstractCegarLoop]: Abstraction has 22401 states and 95054 transitions. [2023-12-02 15:10:01,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 22401 states and 95054 transitions. [2023-12-02 15:10:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 15:10:01,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:01,134 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] [2023-12-02 15:10:01,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 15:10:01,135 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:10:01,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:01,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1305018374, now seen corresponding path program 1 times [2023-12-02 15:10:01,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:01,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34576917] [2023-12-02 15:10:01,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:01,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:10:01,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:10:01,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34576917] [2023-12-02 15:10:01,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34576917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:01,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:10:01,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:10:01,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353046770] [2023-12-02 15:10:01,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:01,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:10:01,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:01,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:10:01,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:10:01,830 INFO L87 Difference]: Start difference. First operand 22401 states and 95054 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:02,580 INFO L93 Difference]: Finished difference Result 24669 states and 103668 transitions. [2023-12-02 15:10:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:10:02,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-02 15:10:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:02,662 INFO L225 Difference]: With dead ends: 24669 [2023-12-02 15:10:02,662 INFO L226 Difference]: Without dead ends: 22821 [2023-12-02 15:10:02,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:10:02,664 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 153 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:02,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 238 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 15:10:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22821 states. [2023-12-02 15:10:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22821 to 20943. [2023-12-02 15:10:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20943 states, 20942 states have (on average 4.234648075637475) internal successors, (88682), 20942 states have internal predecessors, (88682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20943 states to 20943 states and 88682 transitions. [2023-12-02 15:10:03,393 INFO L78 Accepts]: Start accepts. Automaton has 20943 states and 88682 transitions. Word has length 24 [2023-12-02 15:10:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:03,394 INFO L495 AbstractCegarLoop]: Abstraction has 20943 states and 88682 transitions. [2023-12-02 15:10:03,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:03,394 INFO L276 IsEmpty]: Start isEmpty. Operand 20943 states and 88682 transitions. [2023-12-02 15:10:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 15:10:03,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:03,419 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] [2023-12-02 15:10:03,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 15:10:03,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:10:03,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1179733795, now seen corresponding path program 1 times [2023-12-02 15:10:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:03,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064344611] [2023-12-02 15:10:03,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:10:03,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:10:03,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064344611] [2023-12-02 15:10:03,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064344611] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:03,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:10:03,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:10:03,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554246619] [2023-12-02 15:10:03,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:03,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:10:03,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:03,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:10:03,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:10:03,539 INFO L87 Difference]: Start difference. First operand 20943 states and 88682 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:03,817 INFO L93 Difference]: Finished difference Result 20697 states and 83574 transitions. [2023-12-02 15:10:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:10:03,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-02 15:10:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:03,878 INFO L225 Difference]: With dead ends: 20697 [2023-12-02 15:10:03,878 INFO L226 Difference]: Without dead ends: 17610 [2023-12-02 15:10:03,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:10:03,879 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 69 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:03,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 49 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:10:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17610 states. [2023-12-02 15:10:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17610 to 17610. [2023-12-02 15:10:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17610 states, 17609 states have (on average 4.0897836333693) internal successors, (72017), 17609 states have internal predecessors, (72017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:04,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17610 states to 17610 states and 72017 transitions. [2023-12-02 15:10:04,543 INFO L78 Accepts]: Start accepts. Automaton has 17610 states and 72017 transitions. Word has length 24 [2023-12-02 15:10:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:04,543 INFO L495 AbstractCegarLoop]: Abstraction has 17610 states and 72017 transitions. [2023-12-02 15:10:04,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 17610 states and 72017 transitions. [2023-12-02 15:10:04,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 15:10:04,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:04,574 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] [2023-12-02 15:10:04,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 15:10:04,575 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:10:04,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:04,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1057598242, now seen corresponding path program 1 times [2023-12-02 15:10:04,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:04,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489679510] [2023-12-02 15:10:04,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:04,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:10:04,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:10:04,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489679510] [2023-12-02 15:10:04,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489679510] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:04,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:10:04,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:10:04,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854458019] [2023-12-02 15:10:04,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:04,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:10:04,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:04,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:10:04,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:10:04,777 INFO L87 Difference]: Start difference. First operand 17610 states and 72017 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:05,100 INFO L93 Difference]: Finished difference Result 14002 states and 54309 transitions. [2023-12-02 15:10:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:10:05,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-12-02 15:10:05,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:05,149 INFO L225 Difference]: With dead ends: 14002 [2023-12-02 15:10:05,149 INFO L226 Difference]: Without dead ends: 11790 [2023-12-02 15:10:05,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:10:05,150 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 134 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:05,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 64 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:10:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11790 states. [2023-12-02 15:10:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 11790. [2023-12-02 15:10:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11790 states, 11789 states have (on average 3.8872677920095002) internal successors, (45827), 11789 states have internal predecessors, (45827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11790 states to 11790 states and 45827 transitions. [2023-12-02 15:10:05,573 INFO L78 Accepts]: Start accepts. Automaton has 11790 states and 45827 transitions. Word has length 25 [2023-12-02 15:10:05,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:05,573 INFO L495 AbstractCegarLoop]: Abstraction has 11790 states and 45827 transitions. [2023-12-02 15:10:05,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:05,574 INFO L276 IsEmpty]: Start isEmpty. Operand 11790 states and 45827 transitions. [2023-12-02 15:10:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 15:10:05,600 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:05,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:10:05,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 15:10:05,601 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:10:05,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash -963956240, now seen corresponding path program 1 times [2023-12-02 15:10:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:05,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670100262] [2023-12-02 15:10:05,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:10:05,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:10:05,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670100262] [2023-12-02 15:10:05,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670100262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:05,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:10:05,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:10:05,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087018447] [2023-12-02 15:10:05,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:05,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:10:05,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:05,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:10:05,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:10:05,856 INFO L87 Difference]: Start difference. First operand 11790 states and 45827 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:06,102 INFO L93 Difference]: Finished difference Result 9038 states and 34523 transitions. [2023-12-02 15:10:06,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:10:06,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-02 15:10:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:06,128 INFO L225 Difference]: With dead ends: 9038 [2023-12-02 15:10:06,128 INFO L226 Difference]: Without dead ends: 8126 [2023-12-02 15:10:06,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:10:06,129 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 223 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:06,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 75 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:10:06,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8126 states. [2023-12-02 15:10:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8126 to 8126. [2023-12-02 15:10:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8126 states, 8125 states have (on average 3.8364307692307693) internal successors, (31171), 8125 states have internal predecessors, (31171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 31171 transitions. [2023-12-02 15:10:06,323 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 31171 transitions. Word has length 28 [2023-12-02 15:10:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:06,323 INFO L495 AbstractCegarLoop]: Abstraction has 8126 states and 31171 transitions. [2023-12-02 15:10:06,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 31171 transitions. [2023-12-02 15:10:06,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:10:06,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:06,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:10:06,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 15:10:06,339 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:10:06,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:06,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1894476718, now seen corresponding path program 1 times [2023-12-02 15:10:06,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:06,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127934056] [2023-12-02 15:10:06,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:06,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:10:06,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:10:06,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127934056] [2023-12-02 15:10:06,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127934056] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:06,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:10:06,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:10:06,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662285132] [2023-12-02 15:10:06,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:06,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:10:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:06,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:10:06,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:10:06,854 INFO L87 Difference]: Start difference. First operand 8126 states and 31171 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:07,687 INFO L93 Difference]: Finished difference Result 11914 states and 45308 transitions. [2023-12-02 15:10:07,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:10:07,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-12-02 15:10:07,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:07,711 INFO L225 Difference]: With dead ends: 11914 [2023-12-02 15:10:07,711 INFO L226 Difference]: Without dead ends: 9242 [2023-12-02 15:10:07,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2023-12-02 15:10:07,712 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 148 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:07,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 254 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:10:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9242 states. [2023-12-02 15:10:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9242 to 8134. [2023-12-02 15:10:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8134 states, 8133 states have (on average 3.7719168818394198) internal successors, (30677), 8133 states have internal predecessors, (30677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8134 states to 8134 states and 30677 transitions. [2023-12-02 15:10:07,894 INFO L78 Accepts]: Start accepts. Automaton has 8134 states and 30677 transitions. Word has length 33 [2023-12-02 15:10:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:07,895 INFO L495 AbstractCegarLoop]: Abstraction has 8134 states and 30677 transitions. [2023-12-02 15:10:07,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8134 states and 30677 transitions. [2023-12-02 15:10:07,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:10:07,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:07,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:10:07,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 15:10:07,909 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:10:07,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash 3865766, now seen corresponding path program 2 times [2023-12-02 15:10:07,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:07,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749492675] [2023-12-02 15:10:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:07,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:10:08,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:10:08,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749492675] [2023-12-02 15:10:08,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749492675] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:08,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:10:08,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 15:10:08,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524164894] [2023-12-02 15:10:08,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:08,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:10:08,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:08,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:10:08,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:10:08,930 INFO L87 Difference]: Start difference. First operand 8134 states and 30677 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:09,520 INFO L93 Difference]: Finished difference Result 11926 states and 44201 transitions. [2023-12-02 15:10:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 15:10:09,521 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-12-02 15:10:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:09,558 INFO L225 Difference]: With dead ends: 11926 [2023-12-02 15:10:09,558 INFO L226 Difference]: Without dead ends: 10562 [2023-12-02 15:10:09,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-12-02 15:10:09,559 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 204 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:09,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 310 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:10:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10562 states. [2023-12-02 15:10:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10562 to 8690. [2023-12-02 15:10:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8690 states, 8689 states have (on average 3.729543100471861) internal successors, (32406), 8689 states have internal predecessors, (32406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8690 states to 8690 states and 32406 transitions. [2023-12-02 15:10:09,857 INFO L78 Accepts]: Start accepts. Automaton has 8690 states and 32406 transitions. Word has length 33 [2023-12-02 15:10:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:09,858 INFO L495 AbstractCegarLoop]: Abstraction has 8690 states and 32406 transitions. [2023-12-02 15:10:09,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 8690 states and 32406 transitions. [2023-12-02 15:10:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:10:09,877 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:09,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:10:09,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 15:10:09,877 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:10:09,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:09,878 INFO L85 PathProgramCache]: Analyzing trace with hash 883213478, now seen corresponding path program 3 times [2023-12-02 15:10:09,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:09,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960916358] [2023-12-02 15:10:09,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:09,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:10:10,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:10:10,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960916358] [2023-12-02 15:10:10,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960916358] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:10,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:10:10,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 15:10:10,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149493531] [2023-12-02 15:10:10,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:10,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 15:10:10,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:10,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 15:10:10,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-02 15:10:10,748 INFO L87 Difference]: Start difference. First operand 8690 states and 32406 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:11,330 INFO L93 Difference]: Finished difference Result 12482 states and 46068 transitions. [2023-12-02 15:10:11,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:10:11,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-12-02 15:10:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:11,367 INFO L225 Difference]: With dead ends: 12482 [2023-12-02 15:10:11,367 INFO L226 Difference]: Without dead ends: 11730 [2023-12-02 15:10:11,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2023-12-02 15:10:11,368 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 328 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:11,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 245 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:10:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11730 states. [2023-12-02 15:10:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11730 to 8750. [2023-12-02 15:10:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8750 states, 8749 states have (on average 3.732998056920791) internal successors, (32660), 8749 states have internal predecessors, (32660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8750 states to 8750 states and 32660 transitions. [2023-12-02 15:10:11,658 INFO L78 Accepts]: Start accepts. Automaton has 8750 states and 32660 transitions. Word has length 33 [2023-12-02 15:10:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:11,659 INFO L495 AbstractCegarLoop]: Abstraction has 8750 states and 32660 transitions. [2023-12-02 15:10:11,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 8750 states and 32660 transitions. [2023-12-02 15:10:11,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 15:10:11,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:11,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:10:11,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 15:10:11,678 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:10:11,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2087127876, now seen corresponding path program 4 times [2023-12-02 15:10:11,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:11,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844528627] [2023-12-02 15:10:11,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:11,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:10:11,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:10:11,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844528627] [2023-12-02 15:10:11,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844528627] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:11,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:10:11,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:10:11,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079326472] [2023-12-02 15:10:11,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:11,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:10:11,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:11,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:10:11,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:10:11,914 INFO L87 Difference]: Start difference. First operand 8750 states and 32660 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:12,148 INFO L93 Difference]: Finished difference Result 7806 states and 29364 transitions. [2023-12-02 15:10:12,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:10:12,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2023-12-02 15:10:12,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:12,163 INFO L225 Difference]: With dead ends: 7806 [2023-12-02 15:10:12,164 INFO L226 Difference]: Without dead ends: 4222 [2023-12-02 15:10:12,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:10:12,164 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 236 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:12,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 60 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:10:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4222 states. [2023-12-02 15:10:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4222 to 3634. [2023-12-02 15:10:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3634 states, 3633 states have (on average 3.6889622901183596) internal successors, (13402), 3633 states have internal predecessors, (13402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 13402 transitions. [2023-12-02 15:10:12,263 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 13402 transitions. Word has length 33 [2023-12-02 15:10:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:12,263 INFO L495 AbstractCegarLoop]: Abstraction has 3634 states and 13402 transitions. [2023-12-02 15:10:12,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:12,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 13402 transitions. [2023-12-02 15:10:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:10:12,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:12,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:10:12,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 15:10:12,270 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:10:12,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:12,271 INFO L85 PathProgramCache]: Analyzing trace with hash -304716995, now seen corresponding path program 1 times [2023-12-02 15:10:12,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:12,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178415887] [2023-12-02 15:10:12,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:12,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:10:12,696 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:10:12,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178415887] [2023-12-02 15:10:12,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178415887] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:12,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:10:12,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:10:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243439180] [2023-12-02 15:10:12,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:12,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 15:10:12,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:12,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 15:10:12,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:10:12,698 INFO L87 Difference]: Start difference. First operand 3634 states and 13402 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:13,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:13,094 INFO L93 Difference]: Finished difference Result 5406 states and 19544 transitions. [2023-12-02 15:10:13,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:10:13,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-12-02 15:10:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:13,100 INFO L225 Difference]: With dead ends: 5406 [2023-12-02 15:10:13,100 INFO L226 Difference]: Without dead ends: 2742 [2023-12-02 15:10:13,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:10:13,101 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 87 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:13,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 201 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:10:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2023-12-02 15:10:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2434. [2023-12-02 15:10:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 3.510891903000411) internal successors, (8542), 2433 states have internal predecessors, (8542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 8542 transitions. [2023-12-02 15:10:13,145 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 8542 transitions. Word has length 38 [2023-12-02 15:10:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:13,145 INFO L495 AbstractCegarLoop]: Abstraction has 2434 states and 8542 transitions. [2023-12-02 15:10:13,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 8542 transitions. [2023-12-02 15:10:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:10:13,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:13,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:10:13,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 15:10:13,149 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:10:13,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash -853234499, now seen corresponding path program 2 times [2023-12-02 15:10:13,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:13,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820258397] [2023-12-02 15:10:13,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:13,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:10:13,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:10:13,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820258397] [2023-12-02 15:10:13,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820258397] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:13,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:10:13,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:10:13,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652834051] [2023-12-02 15:10:13,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:13,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:10:13,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:13,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:10:13,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:10:13,471 INFO L87 Difference]: Start difference. First operand 2434 states and 8542 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:13,654 INFO L93 Difference]: Finished difference Result 3278 states and 11336 transitions. [2023-12-02 15:10:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:10:13,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-12-02 15:10:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:13,656 INFO L225 Difference]: With dead ends: 3278 [2023-12-02 15:10:13,657 INFO L226 Difference]: Without dead ends: 1210 [2023-12-02 15:10:13,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:10:13,657 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 37 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:13,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 124 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:10:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2023-12-02 15:10:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2023-12-02 15:10:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1209 states have (on average 3.204301075268817) internal successors, (3874), 1209 states have internal predecessors, (3874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3874 transitions. [2023-12-02 15:10:13,675 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3874 transitions. Word has length 38 [2023-12-02 15:10:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:13,675 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 3874 transitions. [2023-12-02 15:10:13,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3874 transitions. [2023-12-02 15:10:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:10:13,677 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:13,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:10:13,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 15:10:13,677 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:10:13,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:13,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2116601963, now seen corresponding path program 3 times [2023-12-02 15:10:13,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:13,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378807502] [2023-12-02 15:10:13,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:13,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:10:14,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:10:14,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378807502] [2023-12-02 15:10:14,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378807502] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:14,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:10:14,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 15:10:14,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137582728] [2023-12-02 15:10:14,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:14,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 15:10:14,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:14,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 15:10:14,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-02 15:10:14,719 INFO L87 Difference]: Start difference. First operand 1210 states and 3874 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:15,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:15,107 INFO L93 Difference]: Finished difference Result 1902 states and 6220 transitions. [2023-12-02 15:10:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 15:10:15,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-12-02 15:10:15,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:15,111 INFO L225 Difference]: With dead ends: 1902 [2023-12-02 15:10:15,111 INFO L226 Difference]: Without dead ends: 1480 [2023-12-02 15:10:15,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-12-02 15:10:15,112 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 97 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:15,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 156 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:10:15,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2023-12-02 15:10:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1156. [2023-12-02 15:10:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 3.1904761904761907) internal successors, (3685), 1155 states have internal predecessors, (3685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 3685 transitions. [2023-12-02 15:10:15,139 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 3685 transitions. Word has length 38 [2023-12-02 15:10:15,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:15,139 INFO L495 AbstractCegarLoop]: Abstraction has 1156 states and 3685 transitions. [2023-12-02 15:10:15,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 3685 transitions. [2023-12-02 15:10:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:10:15,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:15,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:10:15,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 15:10:15,142 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:10:15,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1122959253, now seen corresponding path program 4 times [2023-12-02 15:10:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:15,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356582114] [2023-12-02 15:10:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:10:16,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:10:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356582114] [2023-12-02 15:10:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356582114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:10:16,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:10:16,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 15:10:16,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868654565] [2023-12-02 15:10:16,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:10:16,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 15:10:16,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:10:16,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 15:10:16,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:10:16,330 INFO L87 Difference]: Start difference. First operand 1156 states and 3685 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:16,693 INFO L93 Difference]: Finished difference Result 1716 states and 5589 transitions. [2023-12-02 15:10:16,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:10:16,693 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-12-02 15:10:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:16,696 INFO L225 Difference]: With dead ends: 1716 [2023-12-02 15:10:16,696 INFO L226 Difference]: Without dead ends: 1042 [2023-12-02 15:10:16,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-02 15:10:16,696 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 111 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:16,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 144 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:10:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2023-12-02 15:10:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 946. [2023-12-02 15:10:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 945 states have (on average 3.1978835978835978) internal successors, (3022), 945 states have internal predecessors, (3022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 3022 transitions. [2023-12-02 15:10:16,717 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 3022 transitions. Word has length 38 [2023-12-02 15:10:16,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:16,717 INFO L495 AbstractCegarLoop]: Abstraction has 946 states and 3022 transitions. [2023-12-02 15:10:16,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:10:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 3022 transitions. [2023-12-02 15:10:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 15:10:16,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:16,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:10:16,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 15:10:16,720 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 15:10:16,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1981106069, now seen corresponding path program 5 times [2023-12-02 15:10:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:10:16,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093251498] [2023-12-02 15:10:16,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:10:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:10:16,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:10:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:10:16,861 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 15:10:16,862 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:10:16,863 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-12-02 15:10:16,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-12-02 15:10:16,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-12-02 15:10:16,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-12-02 15:10:16,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-12-02 15:10:16,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-12-02 15:10:16,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-12-02 15:10:16,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 15:10:16,869 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:10:16,875 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 15:10:16,875 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:10:16,951 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-12-02 15:10:16,952 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 15:10:16,954 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 15:10:16,955 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 15:10:16,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:10:16 BasicIcfg [2023-12-02 15:10:16,988 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:10:16,989 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:10:16,989 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:10:16,989 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:10:16,990 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:09:46" (3/4) ... [2023-12-02 15:10:16,990 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 15:10:17,035 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-12-02 15:10:17,036 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 15:10:17,036 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 15:10:17,037 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 15:10:17,117 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 15:10:17,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:10:17,119 INFO L158 Benchmark]: Toolchain (without parser) took 32304.29ms. Allocated memory was 163.6MB in the beginning and 10.3GB in the end (delta: 10.1GB). Free memory was 124.4MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2023-12-02 15:10:17,119 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:10:17,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.09ms. Allocated memory is still 163.6MB. Free memory was 124.4MB in the beginning and 99.7MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-12-02 15:10:17,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.37ms. Allocated memory is still 163.6MB. Free memory was 99.7MB in the beginning and 96.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:10:17,120 INFO L158 Benchmark]: Boogie Preprocessor took 41.62ms. Allocated memory is still 163.6MB. Free memory was 96.7MB in the beginning and 94.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:10:17,120 INFO L158 Benchmark]: RCFGBuilder took 757.18ms. Allocated memory is still 163.6MB. Free memory was 94.6MB in the beginning and 93.9MB in the end (delta: 621.5kB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2023-12-02 15:10:17,121 INFO L158 Benchmark]: TraceAbstraction took 30834.61ms. Allocated memory was 163.6MB in the beginning and 10.3GB in the end (delta: 10.1GB). Free memory was 93.1MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2023-12-02 15:10:17,121 INFO L158 Benchmark]: Witness Printer took 129.27ms. Allocated memory is still 10.3GB. Free memory was 6.1GB in the beginning and 6.0GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 15:10:17,123 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.09ms. Allocated memory is still 163.6MB. Free memory was 124.4MB in the beginning and 99.7MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.37ms. Allocated memory is still 163.6MB. Free memory was 99.7MB in the beginning and 96.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.62ms. Allocated memory is still 163.6MB. Free memory was 96.7MB in the beginning and 94.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 757.18ms. Allocated memory is still 163.6MB. Free memory was 94.6MB in the beginning and 93.9MB in the end (delta: 621.5kB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * TraceAbstraction took 30834.61ms. Allocated memory was 163.6MB in the beginning and 10.3GB in the end (delta: 10.1GB). Free memory was 93.1MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. * Witness Printer took 129.27ms. Allocated memory is still 10.3GB. Free memory was 6.1GB in the beginning and 6.0GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, t1185={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, t1185={5:0}, t1186={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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, t1185={5:0}, t1186={6:0}, t1187={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L825] 4 a = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_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=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=1, __unbuffered_p1_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=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_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=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_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=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p1_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=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_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=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=3, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_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, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_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, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_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, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_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, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_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, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 30.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.4s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2330 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2330 mSDsluCounter, 2771 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2126 mSDsCounter, 169 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3211 IncrementalHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 169 mSolverCounterUnsat, 645 mSDtfsCounter, 3211 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35310occurred in iteration=0, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 9154 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 5345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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! [2023-12-02 15:10:17,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4f5aa2-4f61-47fc-941a-614a75a61f8c/bin/utaipan-verify-nQ1chXbOIh/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