./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ --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 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:13:58,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:13:58,868 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 04:13:58,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:13:58,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:13:58,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:13:58,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:13:58,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:13:58,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:13:58,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:13:58,912 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:13:58,913 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:13:58,914 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:13:58,914 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:13:58,915 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:13:58,916 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:13:58,916 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:13:58,917 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:13:58,917 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:13:58,918 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:13:58,919 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:13:58,919 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:13:58,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:13:58,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:13:58,922 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:13:58,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:13:58,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:13:58,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:13:58,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:13:58,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:13:58,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:13:58,926 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:13:58,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:13:58,928 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:13:58,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:13:58,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:13:58,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:13:58,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:13:58,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:13:58,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:13:58,931 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:13:58,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:13:58,932 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:13:58,932 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:13:58,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:13:58,933 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_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/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_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ 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 -> 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 [2023-11-19 04:13:59,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:13:59,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:13:59,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:13:59,311 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:13:59,312 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:13:59,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2023-11-19 04:14:02,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:14:03,307 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:14:03,307 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2023-11-19 04:14:03,333 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/data/462119f3d/22251262e4a84f6081282d4f1fc94f03/FLAGfa5c74732 [2023-11-19 04:14:03,354 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/data/462119f3d/22251262e4a84f6081282d4f1fc94f03 [2023-11-19 04:14:03,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:14:03,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:14:03,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:14:03,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:14:03,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:14:03,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:14:03" (1/1) ... [2023-11-19 04:14:03,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@594b1f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:03, skipping insertion in model container [2023-11-19 04:14:03,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:14:03" (1/1) ... [2023-11-19 04:14:03,469 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:14:03,732 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_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i[949,962] [2023-11-19 04:14:04,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:14:04,094 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:14:04,108 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_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i[949,962] [2023-11-19 04:14:04,183 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:14:04,231 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:14:04,231 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:14:04,241 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:14:04,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:04 WrapperNode [2023-11-19 04:14:04,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:14:04,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:14:04,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:14:04,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:14:04,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:04" (1/1) ... [2023-11-19 04:14:04,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:04" (1/1) ... [2023-11-19 04:14:04,321 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2023-11-19 04:14:04,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:14:04,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:14:04,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:14:04,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:14:04,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:04" (1/1) ... [2023-11-19 04:14:04,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:04" (1/1) ... [2023-11-19 04:14:04,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:04" (1/1) ... [2023-11-19 04:14:04,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:04" (1/1) ... [2023-11-19 04:14:04,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:04" (1/1) ... [2023-11-19 04:14:04,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:04" (1/1) ... [2023-11-19 04:14:04,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:04" (1/1) ... [2023-11-19 04:14:04,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:04" (1/1) ... [2023-11-19 04:14:04,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:14:04,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:14:04,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:14:04,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:14:04,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:04" (1/1) ... [2023-11-19 04:14:04,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:14:04,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:14:04,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:14:04,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:14:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:14:04,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 04:14:04,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:14:04,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:14:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:14:04,510 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 04:14:04,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 04:14:04,511 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 04:14:04,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 04:14:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 04:14:04,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 04:14:04,512 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 04:14:04,512 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 04:14:04,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:14:04,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 04:14:04,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:14:04,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:14:04,517 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:14:04,789 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:14:04,791 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:14:05,355 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:14:05,587 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:14:05,589 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 04:14:05,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:14:05 BoogieIcfgContainer [2023-11-19 04:14:05,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:14:05,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:14:05,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:14:05,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:14:05,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:14:03" (1/3) ... [2023-11-19 04:14:05,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@903556b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:14:05, skipping insertion in model container [2023-11-19 04:14:05,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:14:04" (2/3) ... [2023-11-19 04:14:05,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@903556b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:14:05, skipping insertion in model container [2023-11-19 04:14:05,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:14:05" (3/3) ... [2023-11-19 04:14:05,612 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2023-11-19 04:14:05,625 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 04:14:05,639 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:14:05,640 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 04:14:05,640 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:14:05,740 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 04:14:05,789 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:14:05,808 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 131 transitions, 278 flow [2023-11-19 04:14:05,812 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 131 transitions, 278 flow [2023-11-19 04:14:05,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 278 flow [2023-11-19 04:14:05,895 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2023-11-19 04:14:05,896 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 04:14:05,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-19 04:14:05,913 INFO L119 LiptonReduction]: Number of co-enabled transitions 3262 [2023-11-19 04:14:13,543 INFO L134 LiptonReduction]: Checked pairs total: 8376 [2023-11-19 04:14:13,543 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-11-19 04:14:13,555 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 82 flow [2023-11-19 04:14:13,871 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2890 states, 2887 states have (on average 3.9279528922757185) internal successors, (11340), 2889 states have internal predecessors, (11340), 0 states have call successors, (0), 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-11-19 04:14:13,901 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:14:13,912 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@382f6d22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:14:13,912 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-19 04:14:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 2890 states, 2887 states have (on average 3.9279528922757185) internal successors, (11340), 2889 states have internal predecessors, (11340), 0 states have call successors, (0), 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-11-19 04:14:13,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 04:14:13,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:13,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:14:13,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:13,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:13,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1437332754, now seen corresponding path program 1 times [2023-11-19 04:14:13,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:13,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338733375] [2023-11-19 04:14:13,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:13,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:14,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338733375] [2023-11-19 04:14:14,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338733375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:14,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:14,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:14:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857372582] [2023-11-19 04:14:14,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:14,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:14:14,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:14,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:14:14,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:14:14,668 INFO L87 Difference]: Start difference. First operand has 2890 states, 2887 states have (on average 3.9279528922757185) internal successors, (11340), 2889 states have internal predecessors, (11340), 0 states have call successors, (0), 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.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-11-19 04:14:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:14,909 INFO L93 Difference]: Finished difference Result 2350 states and 8923 transitions. [2023-11-19 04:14:14,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:14:14,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-11-19 04:14:14,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:14,989 INFO L225 Difference]: With dead ends: 2350 [2023-11-19 04:14:14,990 INFO L226 Difference]: Without dead ends: 2250 [2023-11-19 04:14:14,992 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-11-19 04:14:15,002 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:15,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:14:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2023-11-19 04:14:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2250. [2023-11-19 04:14:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 2249 states have (on average 3.8185860382392174) internal successors, (8588), 2249 states have internal predecessors, (8588), 0 states have call successors, (0), 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-11-19 04:14:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 8588 transitions. [2023-11-19 04:14:15,294 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 8588 transitions. Word has length 7 [2023-11-19 04:14:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:15,296 INFO L495 AbstractCegarLoop]: Abstraction has 2250 states and 8588 transitions. [2023-11-19 04:14:15,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-11-19 04:14:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 8588 transitions. [2023-11-19 04:14:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:14:15,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:15,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:14:15,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:14:15,302 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:15,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:15,303 INFO L85 PathProgramCache]: Analyzing trace with hash 150833217, now seen corresponding path program 1 times [2023-11-19 04:14:15,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:15,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278491927] [2023-11-19 04:14:15,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:15,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:15,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278491927] [2023-11-19 04:14:15,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278491927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:15,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:15,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:14:15,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85231182] [2023-11-19 04:14:15,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:15,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:14:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:15,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:14:15,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:14:15,789 INFO L87 Difference]: Start difference. First operand 2250 states and 8588 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:15,937 INFO L93 Difference]: Finished difference Result 2200 states and 8358 transitions. [2023-11-19 04:14:15,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:14:15,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-19 04:14:15,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:15,972 INFO L225 Difference]: With dead ends: 2200 [2023-11-19 04:14:15,973 INFO L226 Difference]: Without dead ends: 2200 [2023-11-19 04:14:15,973 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-11-19 04:14:15,975 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:15,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 7 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:14:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2023-11-19 04:14:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 2200. [2023-11-19 04:14:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 2199 states have (on average 3.800818553888131) internal successors, (8358), 2199 states have internal predecessors, (8358), 0 states have call successors, (0), 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-11-19 04:14:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8358 transitions. [2023-11-19 04:14:16,182 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8358 transitions. Word has length 11 [2023-11-19 04:14:16,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:16,182 INFO L495 AbstractCegarLoop]: Abstraction has 2200 states and 8358 transitions. [2023-11-19 04:14:16,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8358 transitions. [2023-11-19 04:14:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:14:16,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:16,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:14:16,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:14:16,200 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:16,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:16,201 INFO L85 PathProgramCache]: Analyzing trace with hash 669680262, now seen corresponding path program 1 times [2023-11-19 04:14:16,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:16,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606272364] [2023-11-19 04:14:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:17,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:17,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606272364] [2023-11-19 04:14:17,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606272364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:17,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:17,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:14:17,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529458371] [2023-11-19 04:14:17,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:17,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:14:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:17,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:14:17,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:14:17,099 INFO L87 Difference]: Start difference. First operand 2200 states and 8358 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:17,243 INFO L93 Difference]: Finished difference Result 2170 states and 8224 transitions. [2023-11-19 04:14:17,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:14:17,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 04:14:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:17,275 INFO L225 Difference]: With dead ends: 2170 [2023-11-19 04:14:17,275 INFO L226 Difference]: Without dead ends: 2170 [2023-11-19 04:14:17,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:14:17,281 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:17,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 7 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:14:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2023-11-19 04:14:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2023-11-19 04:14:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 3.7916090364223143) internal successors, (8224), 2169 states have internal predecessors, (8224), 0 states have call successors, (0), 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-11-19 04:14:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 8224 transitions. [2023-11-19 04:14:17,427 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 8224 transitions. Word has length 12 [2023-11-19 04:14:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:17,427 INFO L495 AbstractCegarLoop]: Abstraction has 2170 states and 8224 transitions. [2023-11-19 04:14:17,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 8224 transitions. [2023-11-19 04:14:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 04:14:17,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:17,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:14:17,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:14:17,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:17,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash 208667963, now seen corresponding path program 1 times [2023-11-19 04:14:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:17,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891953985] [2023-11-19 04:14:17,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:18,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:18,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891953985] [2023-11-19 04:14:18,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891953985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:18,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:18,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:14:18,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643908392] [2023-11-19 04:14:18,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:18,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:14:18,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:18,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:14:18,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:14:18,174 INFO L87 Difference]: Start difference. First operand 2170 states and 8224 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:18,432 INFO L93 Difference]: Finished difference Result 2146 states and 8110 transitions. [2023-11-19 04:14:18,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:14:18,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 04:14:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:18,463 INFO L225 Difference]: With dead ends: 2146 [2023-11-19 04:14:18,463 INFO L226 Difference]: Without dead ends: 2146 [2023-11-19 04:14:18,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:14:18,467 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:18,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:14:18,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2023-11-19 04:14:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2110. [2023-11-19 04:14:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2110 states, 2109 states have (on average 3.779516358463727) internal successors, (7971), 2109 states have internal predecessors, (7971), 0 states have call successors, (0), 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-11-19 04:14:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 7971 transitions. [2023-11-19 04:14:18,582 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 7971 transitions. Word has length 13 [2023-11-19 04:14:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:18,584 INFO L495 AbstractCegarLoop]: Abstraction has 2110 states and 7971 transitions. [2023-11-19 04:14:18,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 7971 transitions. [2023-11-19 04:14:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 04:14:18,587 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:18,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:14:18,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:14:18,588 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:18,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:18,589 INFO L85 PathProgramCache]: Analyzing trace with hash -714749428, now seen corresponding path program 1 times [2023-11-19 04:14:18,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:18,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223662717] [2023-11-19 04:14:18,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:18,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:19,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:19,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223662717] [2023-11-19 04:14:19,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223662717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:19,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:19,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:14:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375921048] [2023-11-19 04:14:19,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:19,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:14:19,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:19,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:14:19,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:14:19,536 INFO L87 Difference]: Start difference. First operand 2110 states and 7971 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:19,730 INFO L93 Difference]: Finished difference Result 2170 states and 8179 transitions. [2023-11-19 04:14:19,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:14:19,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 04:14:19,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:19,761 INFO L225 Difference]: With dead ends: 2170 [2023-11-19 04:14:19,761 INFO L226 Difference]: Without dead ends: 2170 [2023-11-19 04:14:19,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:14:19,763 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 34 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:19,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:14:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2023-11-19 04:14:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2023-11-19 04:14:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 3.7708621484555094) internal successors, (8179), 2169 states have internal predecessors, (8179), 0 states have call successors, (0), 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-11-19 04:14:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 8179 transitions. [2023-11-19 04:14:19,880 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 8179 transitions. Word has length 13 [2023-11-19 04:14:19,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:19,881 INFO L495 AbstractCegarLoop]: Abstraction has 2170 states and 8179 transitions. [2023-11-19 04:14:19,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 8179 transitions. [2023-11-19 04:14:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 04:14:19,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:19,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:14:19,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:14:19,891 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:19,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:19,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2121228809, now seen corresponding path program 1 times [2023-11-19 04:14:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:19,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563253338] [2023-11-19 04:14:19,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:19,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:20,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:20,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563253338] [2023-11-19 04:14:20,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563253338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:20,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:20,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:14:20,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264534665] [2023-11-19 04:14:20,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:20,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:14:20,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:20,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:14:20,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:14:20,691 INFO L87 Difference]: Start difference. First operand 2170 states and 8179 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:20,959 INFO L93 Difference]: Finished difference Result 2490 states and 9343 transitions. [2023-11-19 04:14:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:14:20,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 04:14:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:20,992 INFO L225 Difference]: With dead ends: 2490 [2023-11-19 04:14:20,992 INFO L226 Difference]: Without dead ends: 2490 [2023-11-19 04:14:20,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:14:20,993 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 62 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:20,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 18 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:14:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2023-11-19 04:14:21,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2466. [2023-11-19 04:14:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2465 states have (on average 3.752129817444219) internal successors, (9249), 2465 states have internal predecessors, (9249), 0 states have call successors, (0), 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-11-19 04:14:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 9249 transitions. [2023-11-19 04:14:21,115 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 9249 transitions. Word has length 14 [2023-11-19 04:14:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:21,116 INFO L495 AbstractCegarLoop]: Abstraction has 2466 states and 9249 transitions. [2023-11-19 04:14:21,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 9249 transitions. [2023-11-19 04:14:21,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:14:21,121 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:21,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:14:21,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 04:14:21,122 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:21,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:21,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1333587003, now seen corresponding path program 1 times [2023-11-19 04:14:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417857400] [2023-11-19 04:14:21,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:22,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:22,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417857400] [2023-11-19 04:14:22,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417857400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:22,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:22,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:14:22,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625378380] [2023-11-19 04:14:22,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:22,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:14:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:22,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:14:22,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:14:22,488 INFO L87 Difference]: Start difference. First operand 2466 states and 9249 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:22,801 INFO L93 Difference]: Finished difference Result 2514 states and 9373 transitions. [2023-11-19 04:14:22,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:14:22,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 04:14:22,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:22,823 INFO L225 Difference]: With dead ends: 2514 [2023-11-19 04:14:22,823 INFO L226 Difference]: Without dead ends: 2514 [2023-11-19 04:14:22,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:14:22,825 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 60 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:22,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 29 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:14:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2023-11-19 04:14:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2242. [2023-11-19 04:14:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2241 states have (on average 3.738063364569389) internal successors, (8377), 2241 states have internal predecessors, (8377), 0 states have call successors, (0), 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-11-19 04:14:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 8377 transitions. [2023-11-19 04:14:22,934 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 8377 transitions. Word has length 15 [2023-11-19 04:14:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:22,935 INFO L495 AbstractCegarLoop]: Abstraction has 2242 states and 8377 transitions. [2023-11-19 04:14:22,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 8377 transitions. [2023-11-19 04:14:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:14:22,940 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:22,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:14:22,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 04:14:22,941 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:22,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash 320466379, now seen corresponding path program 1 times [2023-11-19 04:14:22,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:22,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174864523] [2023-11-19 04:14:22,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:22,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:23,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:23,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174864523] [2023-11-19 04:14:23,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174864523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:23,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:23,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:14:23,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010298371] [2023-11-19 04:14:23,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:23,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:14:23,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:23,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:14:23,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:14:23,263 INFO L87 Difference]: Start difference. First operand 2242 states and 8377 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:23,444 INFO L93 Difference]: Finished difference Result 2330 states and 7952 transitions. [2023-11-19 04:14:23,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:14:23,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 04:14:23,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:23,466 INFO L225 Difference]: With dead ends: 2330 [2023-11-19 04:14:23,466 INFO L226 Difference]: Without dead ends: 1750 [2023-11-19 04:14:23,466 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-11-19 04:14:23,469 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:23,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 20 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:14:23,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2023-11-19 04:14:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1750. [2023-11-19 04:14:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1749 states have (on average 3.3830760434534017) internal successors, (5917), 1749 states have internal predecessors, (5917), 0 states have call successors, (0), 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-11-19 04:14:23,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 5917 transitions. [2023-11-19 04:14:23,596 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 5917 transitions. Word has length 15 [2023-11-19 04:14:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:23,596 INFO L495 AbstractCegarLoop]: Abstraction has 1750 states and 5917 transitions. [2023-11-19 04:14:23,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 5917 transitions. [2023-11-19 04:14:23,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:14:23,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:23,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:14:23,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 04:14:23,602 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:23,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:23,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1342951178, now seen corresponding path program 1 times [2023-11-19 04:14:23,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:23,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073834581] [2023-11-19 04:14:23,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:23,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:23,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:23,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:23,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073834581] [2023-11-19 04:14:23,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073834581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:23,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:23,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:14:23,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443078049] [2023-11-19 04:14:23,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:23,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:14:23,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:23,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:14:23,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:14:23,912 INFO L87 Difference]: Start difference. First operand 1750 states and 5917 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-11-19 04:14:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:24,118 INFO L93 Difference]: Finished difference Result 1510 states and 4702 transitions. [2023-11-19 04:14:24,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:14:24,120 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-11-19 04:14:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:24,126 INFO L225 Difference]: With dead ends: 1510 [2023-11-19 04:14:24,127 INFO L226 Difference]: Without dead ends: 1146 [2023-11-19 04:14:24,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:14:24,129 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 62 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:24,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 28 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:14:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2023-11-19 04:14:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1146. [2023-11-19 04:14:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 3.05764192139738) internal successors, (3501), 1145 states have internal predecessors, (3501), 0 states have call successors, (0), 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-11-19 04:14:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 3501 transitions. [2023-11-19 04:14:24,180 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 3501 transitions. Word has length 16 [2023-11-19 04:14:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:24,181 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 3501 transitions. [2023-11-19 04:14:24,181 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-11-19 04:14:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 3501 transitions. [2023-11-19 04:14:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 04:14:24,185 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:24,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:14:24,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 04:14:24,186 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:24,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1763996350, now seen corresponding path program 1 times [2023-11-19 04:14:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:24,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529655612] [2023-11-19 04:14:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:24,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:24,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:24,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529655612] [2023-11-19 04:14:24,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529655612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:24,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:24,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:14:24,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384894686] [2023-11-19 04:14:24,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:24,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:14:24,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:24,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:14:24,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:14:24,430 INFO L87 Difference]: Start difference. First operand 1146 states and 3501 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-19 04:14:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:24,539 INFO L93 Difference]: Finished difference Result 1639 states and 4868 transitions. [2023-11-19 04:14:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:14:24,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-11-19 04:14:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:24,547 INFO L225 Difference]: With dead ends: 1639 [2023-11-19 04:14:24,547 INFO L226 Difference]: Without dead ends: 1159 [2023-11-19 04:14:24,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:14:24,548 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:24,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 10 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:14:24,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2023-11-19 04:14:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1137. [2023-11-19 04:14:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1136 states have (on average 2.8899647887323945) internal successors, (3283), 1136 states have internal predecessors, (3283), 0 states have call successors, (0), 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-11-19 04:14:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 3283 transitions. [2023-11-19 04:14:24,616 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 3283 transitions. Word has length 18 [2023-11-19 04:14:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:24,618 INFO L495 AbstractCegarLoop]: Abstraction has 1137 states and 3283 transitions. [2023-11-19 04:14:24,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-11-19 04:14:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 3283 transitions. [2023-11-19 04:14:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:14:24,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:24,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:14:24,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 04:14:24,623 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:24,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:24,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1587220353, now seen corresponding path program 1 times [2023-11-19 04:14:24,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:24,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541673032] [2023-11-19 04:14:24,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:24,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:24,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:24,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541673032] [2023-11-19 04:14:24,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541673032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:24,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:24,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:14:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612792426] [2023-11-19 04:14:24,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:24,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:14:24,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:24,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:14:24,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:14:24,907 INFO L87 Difference]: Start difference. First operand 1137 states and 3283 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:25,144 INFO L93 Difference]: Finished difference Result 998 states and 2841 transitions. [2023-11-19 04:14:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:14:25,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-19 04:14:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:25,148 INFO L225 Difference]: With dead ends: 998 [2023-11-19 04:14:25,149 INFO L226 Difference]: Without dead ends: 880 [2023-11-19 04:14:25,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:14:25,150 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 67 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:25,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 35 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:14:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2023-11-19 04:14:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 848. [2023-11-19 04:14:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 2.8925619834710745) internal successors, (2450), 847 states have internal predecessors, (2450), 0 states have call successors, (0), 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-11-19 04:14:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 2450 transitions. [2023-11-19 04:14:25,186 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 2450 transitions. Word has length 19 [2023-11-19 04:14:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:25,187 INFO L495 AbstractCegarLoop]: Abstraction has 848 states and 2450 transitions. [2023-11-19 04:14:25,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 2450 transitions. [2023-11-19 04:14:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 04:14:25,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:25,191 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-11-19 04:14:25,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 04:14:25,192 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:25,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:25,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1520177042, now seen corresponding path program 1 times [2023-11-19 04:14:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:25,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122408093] [2023-11-19 04:14:25,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:25,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:25,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:25,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122408093] [2023-11-19 04:14:25,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122408093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:25,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:25,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:14:25,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623426689] [2023-11-19 04:14:25,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:25,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:14:25,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:25,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:14:25,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:14:25,568 INFO L87 Difference]: Start difference. First operand 848 states and 2450 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-11-19 04:14:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:25,782 INFO L93 Difference]: Finished difference Result 819 states and 2391 transitions. [2023-11-19 04:14:25,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 04:14:25,783 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-11-19 04:14:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:25,785 INFO L225 Difference]: With dead ends: 819 [2023-11-19 04:14:25,785 INFO L226 Difference]: Without dead ends: 505 [2023-11-19 04:14:25,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:14:25,786 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 79 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:25,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 25 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:14:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2023-11-19 04:14:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 457. [2023-11-19 04:14:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 2.837719298245614) internal successors, (1294), 456 states have internal predecessors, (1294), 0 states have call successors, (0), 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-11-19 04:14:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1294 transitions. [2023-11-19 04:14:25,806 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1294 transitions. Word has length 22 [2023-11-19 04:14:25,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:25,807 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 1294 transitions. [2023-11-19 04:14:25,807 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-11-19 04:14:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1294 transitions. [2023-11-19 04:14:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 04:14:25,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:25,810 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] [2023-11-19 04:14:25,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 04:14:25,811 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:25,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1906202191, now seen corresponding path program 1 times [2023-11-19 04:14:25,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:25,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931011254] [2023-11-19 04:14:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:25,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:26,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:26,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931011254] [2023-11-19 04:14:26,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931011254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:26,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:26,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:14:26,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209387313] [2023-11-19 04:14:26,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:26,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:14:26,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:26,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:14:26,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:14:26,131 INFO L87 Difference]: Start difference. First operand 457 states and 1294 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:26,260 INFO L93 Difference]: Finished difference Result 624 states and 1748 transitions. [2023-11-19 04:14:26,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:14:26,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-19 04:14:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:26,262 INFO L225 Difference]: With dead ends: 624 [2023-11-19 04:14:26,262 INFO L226 Difference]: Without dead ends: 209 [2023-11-19 04:14:26,263 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-11-19 04:14:26,263 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:26,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 13 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:14:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-19 04:14:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2023-11-19 04:14:26,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.5673076923076925) internal successors, (534), 208 states have internal predecessors, (534), 0 states have call successors, (0), 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-11-19 04:14:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 534 transitions. [2023-11-19 04:14:26,273 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 534 transitions. Word has length 26 [2023-11-19 04:14:26,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:26,274 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 534 transitions. [2023-11-19 04:14:26,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:26,274 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 534 transitions. [2023-11-19 04:14:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 04:14:26,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:26,277 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] [2023-11-19 04:14:26,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 04:14:26,278 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:26,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:26,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1956297221, now seen corresponding path program 2 times [2023-11-19 04:14:26,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:26,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443765510] [2023-11-19 04:14:26,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:26,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:26,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:26,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443765510] [2023-11-19 04:14:26,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443765510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:26,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:26,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:14:26,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460759275] [2023-11-19 04:14:26,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:26,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:14:26,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:26,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:14:26,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:14:26,597 INFO L87 Difference]: Start difference. First operand 209 states and 534 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:26,707 INFO L93 Difference]: Finished difference Result 322 states and 820 transitions. [2023-11-19 04:14:26,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:14:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-19 04:14:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:26,709 INFO L225 Difference]: With dead ends: 322 [2023-11-19 04:14:26,709 INFO L226 Difference]: Without dead ends: 135 [2023-11-19 04:14:26,709 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-11-19 04:14:26,710 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:26,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 10 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:14:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-19 04:14:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-11-19 04:14:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.373134328358209) internal successors, (318), 134 states have internal predecessors, (318), 0 states have call successors, (0), 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-11-19 04:14:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 318 transitions. [2023-11-19 04:14:26,716 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 318 transitions. Word has length 26 [2023-11-19 04:14:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:26,716 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 318 transitions. [2023-11-19 04:14:26,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 318 transitions. [2023-11-19 04:14:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 04:14:26,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:26,722 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] [2023-11-19 04:14:26,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 04:14:26,723 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:26,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:26,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2077687093, now seen corresponding path program 3 times [2023-11-19 04:14:26,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:26,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884824751] [2023-11-19 04:14:26,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:26,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:27,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884824751] [2023-11-19 04:14:27,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884824751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:27,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:27,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:14:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059303505] [2023-11-19 04:14:27,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:27,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:14:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:27,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:14:27,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:14:27,734 INFO L87 Difference]: Start difference. First operand 135 states and 318 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:27,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:27,932 INFO L93 Difference]: Finished difference Result 185 states and 436 transitions. [2023-11-19 04:14:27,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:14:27,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-19 04:14:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:27,935 INFO L225 Difference]: With dead ends: 185 [2023-11-19 04:14:27,935 INFO L226 Difference]: Without dead ends: 135 [2023-11-19 04:14:27,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-11-19 04:14:27,936 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:27,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 13 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:14:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-19 04:14:27,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2023-11-19 04:14:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.1636363636363636) internal successors, (238), 110 states have internal predecessors, (238), 0 states have call successors, (0), 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-11-19 04:14:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 238 transitions. [2023-11-19 04:14:27,943 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 238 transitions. Word has length 26 [2023-11-19 04:14:27,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:27,944 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 238 transitions. [2023-11-19 04:14:27,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:27,944 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 238 transitions. [2023-11-19 04:14:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 04:14:27,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:27,945 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] [2023-11-19 04:14:27,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 04:14:27,946 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:27,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash -198505259, now seen corresponding path program 4 times [2023-11-19 04:14:27,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:27,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957438303] [2023-11-19 04:14:27,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:27,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:14:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:14:29,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:14:29,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957438303] [2023-11-19 04:14:29,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957438303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:14:29,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:14:29,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:14:29,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055535179] [2023-11-19 04:14:29,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:14:29,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 04:14:29,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:14:29,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 04:14:29,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:14:29,505 INFO L87 Difference]: Start difference. First operand 111 states and 238 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:14:29,661 INFO L93 Difference]: Finished difference Result 149 states and 324 transitions. [2023-11-19 04:14:29,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:14:29,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-19 04:14:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:14:29,663 INFO L225 Difference]: With dead ends: 149 [2023-11-19 04:14:29,663 INFO L226 Difference]: Without dead ends: 91 [2023-11-19 04:14:29,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:14:29,664 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:14:29,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 11 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:14:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-19 04:14:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-19 04:14:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 2.1555555555555554) internal successors, (194), 90 states have internal predecessors, (194), 0 states have call successors, (0), 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-11-19 04:14:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 194 transitions. [2023-11-19 04:14:29,669 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 194 transitions. Word has length 26 [2023-11-19 04:14:29,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:14:29,669 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 194 transitions. [2023-11-19 04:14:29,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:14:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 194 transitions. [2023-11-19 04:14:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 04:14:29,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:14:29,670 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] [2023-11-19 04:14:29,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 04:14:29,671 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-19 04:14:29,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:14:29,672 INFO L85 PathProgramCache]: Analyzing trace with hash -587701307, now seen corresponding path program 5 times [2023-11-19 04:14:29,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:14:29,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134455970] [2023-11-19 04:14:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:14:29,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:14:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:14:29,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:14:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:14:29,859 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:14:29,860 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:14:29,861 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-19 04:14:29,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-19 04:14:29,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-19 04:14:29,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-19 04:14:29,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-19 04:14:29,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-19 04:14:29,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-19 04:14:29,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 04:14:29,866 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:14:29,871 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 04:14:29,871 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 04:14:29,938 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 04:14:29,940 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 04:14:29,941 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 04:14:29,942 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 04:14:29,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:14:29 BasicIcfg [2023-11-19 04:14:29,975 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 04:14:29,975 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 04:14:29,975 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 04:14:29,975 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 04:14:29,976 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:14:05" (3/4) ... [2023-11-19 04:14:29,977 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 04:14:30,029 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 04:14:30,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 04:14:30,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 04:14:30,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 04:14:30,128 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/witness.graphml [2023-11-19 04:14:30,128 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 04:14:30,129 INFO L158 Benchmark]: Toolchain (without parser) took 26761.00ms. Allocated memory was 144.7MB in the beginning and 408.9MB in the end (delta: 264.2MB). Free memory was 99.1MB in the beginning and 137.7MB in the end (delta: -38.5MB). Peak memory consumption was 227.7MB. Max. memory is 16.1GB. [2023-11-19 04:14:30,129 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 144.7MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:14:30,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 869.88ms. Allocated memory is still 144.7MB. Free memory was 99.1MB in the beginning and 75.2MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 04:14:30,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.92ms. Allocated memory is still 144.7MB. Free memory was 75.2MB in the beginning and 72.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:14:30,131 INFO L158 Benchmark]: Boogie Preprocessor took 70.71ms. Allocated memory is still 144.7MB. Free memory was 72.3MB in the beginning and 70.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:14:30,131 INFO L158 Benchmark]: RCFGBuilder took 1189.27ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 70.7MB in the beginning and 142.9MB in the end (delta: -72.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2023-11-19 04:14:30,131 INFO L158 Benchmark]: TraceAbstraction took 24372.89ms. Allocated memory was 195.0MB in the beginning and 408.9MB in the end (delta: 213.9MB). Free memory was 142.9MB in the beginning and 150.2MB in the end (delta: -7.3MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB. [2023-11-19 04:14:30,132 INFO L158 Benchmark]: Witness Printer took 152.83ms. Allocated memory is still 408.9MB. Free memory was 150.2MB in the beginning and 137.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 04:14:30,138 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.39ms. Allocated memory is still 144.7MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 869.88ms. Allocated memory is still 144.7MB. Free memory was 99.1MB in the beginning and 75.2MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.92ms. Allocated memory is still 144.7MB. Free memory was 75.2MB in the beginning and 72.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.71ms. Allocated memory is still 144.7MB. Free memory was 72.3MB in the beginning and 70.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1189.27ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 70.7MB in the beginning and 142.9MB in the end (delta: -72.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24372.89ms. Allocated memory was 195.0MB in the beginning and 408.9MB in the end (delta: 213.9MB). Free memory was 142.9MB in the beginning and 150.2MB in the end (delta: -7.3MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB. * Witness Printer took 152.83ms. Allocated memory is still 408.9MB. Free memory was 150.2MB in the beginning and 137.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 142 PlacesBefore, 45 PlacesAfterwards, 131 TransitionsBefore, 33 TransitionsAfterwards, 3262 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 8376 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4131, independent: 3914, independent conditional: 0, independent unconditional: 3914, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2327, independent: 2260, independent conditional: 0, independent unconditional: 2260, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2327, independent: 2228, independent conditional: 0, independent unconditional: 2228, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 99, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 664, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 581, dependent conditional: 0, dependent unconditional: 581, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4131, independent: 1654, independent conditional: 0, independent unconditional: 1654, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 2327, unknown conditional: 0, unknown unconditional: 2327] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1433; [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t1434; [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t1435; [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] 0 pthread_t t1436; [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - 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: 844]: 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: 846]: 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: 842]: 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: 848]: 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, 167 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 24.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 608 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 608 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 163 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1433 IncrementalHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 101 mSDtfsCounter, 1433 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2890occurred in iteration=0, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 458 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 1997 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-11-19 04:14:30,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46987c1b-3aa9-4ab5-af91-a06cc9ab9ac9/bin/utaipan-verify-t7M7D8N6sZ/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