./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91 --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 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:00:33,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:00:33,331 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-25 00:00:33,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:00:33,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:00:33,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:00:33,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:00:33,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:00:33,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:00:33,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:00:33,395 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:00:33,395 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:00:33,396 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:00:33,397 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:00:33,397 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:00:33,398 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:00:33,398 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:00:33,399 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:00:33,400 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:00:33,400 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:00:33,401 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:00:33,401 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:00:33,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:00:33,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:00:33,403 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:00:33,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:00:33,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:00:33,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:00:33,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:00:33,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:00:33,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:00:33,406 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:00:33,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:00:33,407 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:00:33,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:00:33,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:00:33,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:00:33,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:00:33,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:00:33,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:00:33,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:00:33,421 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:00:33,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:00:33,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:00:33,422 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:00:33,422 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:00:33,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:00:33,423 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_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/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_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91 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 -> 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd [2023-11-25 00:00:33,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:00:33,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:00:33,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:00:33,801 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:00:33,802 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:00:33,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2023-11-25 00:00:36,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:00:37,337 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:00:37,338 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2023-11-25 00:00:37,385 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/data/00a1c6756/9b813972fb60437fb997925346798551/FLAG2b08bb9e4 [2023-11-25 00:00:37,402 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/data/00a1c6756/9b813972fb60437fb997925346798551 [2023-11-25 00:00:37,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:00:37,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:00:37,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:00:37,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:00:37,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:00:37,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:00:37" (1/1) ... [2023-11-25 00:00:37,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12053b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:37, skipping insertion in model container [2023-11-25 00:00:37,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:00:37" (1/1) ... [2023-11-25 00:00:37,505 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:00:37,706 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_0e221751-5951-45d7-8e77-12b98561b6c1/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2023-11-25 00:00:37,923 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:00:37,934 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:00:37,954 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_0e221751-5951-45d7-8e77-12b98561b6c1/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2023-11-25 00:00:38,025 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:00:38,059 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-25 00:00:38,059 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-25 00:00:38,067 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:00:38,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:38 WrapperNode [2023-11-25 00:00:38,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:00:38,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:00:38,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:00:38,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:00:38,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:38" (1/1) ... [2023-11-25 00:00:38,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:38" (1/1) ... [2023-11-25 00:00:38,161 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-25 00:00:38,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:00:38,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:00:38,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:00:38,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:00:38,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:38" (1/1) ... [2023-11-25 00:00:38,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:38" (1/1) ... [2023-11-25 00:00:38,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:38" (1/1) ... [2023-11-25 00:00:38,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:38" (1/1) ... [2023-11-25 00:00:38,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:38" (1/1) ... [2023-11-25 00:00:38,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:38" (1/1) ... [2023-11-25 00:00:38,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:38" (1/1) ... [2023-11-25 00:00:38,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:38" (1/1) ... [2023-11-25 00:00:38,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:00:38,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:00:38,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:00:38,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:00:38,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:38" (1/1) ... [2023-11-25 00:00:38,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:00:38,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:00:38,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:00:38,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:00:38,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:00:38,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-25 00:00:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:00:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-25 00:00:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:00:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-25 00:00:38,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-25 00:00:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-25 00:00:38,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-25 00:00:38,325 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-25 00:00:38,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-25 00:00:38,325 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-25 00:00:38,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-25 00:00:38,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:00:38,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-25 00:00:38,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:00:38,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:00:38,329 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-25 00:00:38,521 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:00:38,524 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:00:38,900 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:00:39,238 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:00:39,238 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-25 00:00:39,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:00:39 BoogieIcfgContainer [2023-11-25 00:00:39,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:00:39,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:00:39,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:00:39,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:00:39,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:00:37" (1/3) ... [2023-11-25 00:00:39,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730b57e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:00:39, skipping insertion in model container [2023-11-25 00:00:39,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:00:38" (2/3) ... [2023-11-25 00:00:39,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730b57e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:00:39, skipping insertion in model container [2023-11-25 00:00:39,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:00:39" (3/3) ... [2023-11-25 00:00:39,251 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2023-11-25 00:00:39,260 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-25 00:00:39,270 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:00:39,271 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-25 00:00:39,271 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-25 00:00:39,339 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-25 00:00:39,377 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 60 places, 48 transitions, 112 flow [2023-11-25 00:00:41,083 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 27554 states, 27551 states have (on average 4.339588399695111) internal successors, (119560), 27553 states have internal predecessors, (119560), 0 states have call successors, (0), 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-25 00:00:41,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:00:41,109 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;@74a4bf84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:00:41,110 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-25 00:00:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 27554 states, 27551 states have (on average 4.339588399695111) internal successors, (119560), 27553 states have internal predecessors, (119560), 0 states have call successors, (0), 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-25 00:00:41,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-25 00:00:41,200 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:41,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:00:41,201 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:00:41,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:41,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1080166695, now seen corresponding path program 1 times [2023-11-25 00:00:41,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:41,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486984020] [2023-11-25 00:00:41,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:41,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:42,150 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-25 00:00:42,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:42,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486984020] [2023-11-25 00:00:42,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486984020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:42,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:42,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-25 00:00:42,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276081966] [2023-11-25 00:00:42,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:42,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:00:42,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:42,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:00:42,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:00:42,311 INFO L87 Difference]: Start difference. First operand has 27554 states, 27551 states have (on average 4.339588399695111) internal successors, (119560), 27553 states have internal predecessors, (119560), 0 states have call successors, (0), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:00:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:43,061 INFO L93 Difference]: Finished difference Result 23781 states and 101626 transitions. [2023-11-25 00:00:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:00:43,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-25 00:00:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:43,590 INFO L225 Difference]: With dead ends: 23781 [2023-11-25 00:00:43,590 INFO L226 Difference]: Without dead ends: 22409 [2023-11-25 00:00:43,592 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-25 00:00:43,595 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:43,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 42 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:00:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22409 states. [2023-11-25 00:00:44,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22409 to 22409. [2023-11-25 00:00:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22409 states, 22408 states have (on average 4.285969296679757) internal successors, (96040), 22408 states have internal predecessors, (96040), 0 states have call successors, (0), 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-25 00:00:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22409 states to 22409 states and 96040 transitions. [2023-11-25 00:00:45,558 INFO L78 Accepts]: Start accepts. Automaton has 22409 states and 96040 transitions. Word has length 10 [2023-11-25 00:00:45,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:45,560 INFO L495 AbstractCegarLoop]: Abstraction has 22409 states and 96040 transitions. [2023-11-25 00:00:45,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:00:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 22409 states and 96040 transitions. [2023-11-25 00:00:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-25 00:00:45,577 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:45,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:00:45,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:00:45,578 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:00:45,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1698737453, now seen corresponding path program 1 times [2023-11-25 00:00:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:45,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951756336] [2023-11-25 00:00:45,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:45,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:45,936 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-25 00:00:45,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:45,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951756336] [2023-11-25 00:00:45,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951756336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:45,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:45,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-25 00:00:45,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589329316] [2023-11-25 00:00:45,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:45,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-25 00:00:45,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:45,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-25 00:00:45,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:00:45,941 INFO L87 Difference]: Start difference. First operand 22409 states and 96040 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:00:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:46,836 INFO L93 Difference]: Finished difference Result 20435 states and 83022 transitions. [2023-11-25 00:00:46,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-25 00:00:46,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-25 00:00:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:47,235 INFO L225 Difference]: With dead ends: 20435 [2023-11-25 00:00:47,235 INFO L226 Difference]: Without dead ends: 18034 [2023-11-25 00:00:47,235 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-25 00:00:47,237 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 76 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:47,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 52 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:00:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18034 states. [2023-11-25 00:00:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18034 to 18034. [2023-11-25 00:00:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18034 states, 18033 states have (on average 4.112737758553762) internal successors, (74165), 18033 states have internal predecessors, (74165), 0 states have call successors, (0), 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-25 00:00:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18034 states to 18034 states and 74165 transitions. [2023-11-25 00:00:48,468 INFO L78 Accepts]: Start accepts. Automaton has 18034 states and 74165 transitions. Word has length 16 [2023-11-25 00:00:48,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:48,469 INFO L495 AbstractCegarLoop]: Abstraction has 18034 states and 74165 transitions. [2023-11-25 00:00:48,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:00:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 18034 states and 74165 transitions. [2023-11-25 00:00:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-25 00:00:48,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:48,502 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] [2023-11-25 00:00:48,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-25 00:00:48,503 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:00:48,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash -795893375, now seen corresponding path program 1 times [2023-11-25 00:00:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:48,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221876521] [2023-11-25 00:00:48,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:48,816 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-25 00:00:48,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:48,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221876521] [2023-11-25 00:00:48,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221876521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:48,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:48,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:00:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327562810] [2023-11-25 00:00:48,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:48,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:00:48,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:48,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:00:48,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:00:48,829 INFO L87 Difference]: Start difference. First operand 18034 states and 74165 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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-25 00:00:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:49,136 INFO L93 Difference]: Finished difference Result 12810 states and 49397 transitions. [2023-11-25 00:00:49,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-25 00:00:49,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-11-25 00:00:49,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:49,218 INFO L225 Difference]: With dead ends: 12810 [2023-11-25 00:00:49,219 INFO L226 Difference]: Without dead ends: 11034 [2023-11-25 00:00:49,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:00:49,220 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 128 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:49,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 68 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:00:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2023-11-25 00:00:49,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 11034. [2023-11-25 00:00:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11034 states, 11033 states have (on average 3.867035257862775) internal successors, (42665), 11033 states have internal predecessors, (42665), 0 states have call successors, (0), 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-25 00:00:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11034 states to 11034 states and 42665 transitions. [2023-11-25 00:00:49,913 INFO L78 Accepts]: Start accepts. Automaton has 11034 states and 42665 transitions. Word has length 21 [2023-11-25 00:00:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:49,913 INFO L495 AbstractCegarLoop]: Abstraction has 11034 states and 42665 transitions. [2023-11-25 00:00:49,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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-25 00:00:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 11034 states and 42665 transitions. [2023-11-25 00:00:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-25 00:00:49,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:49,941 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-25 00:00:49,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-25 00:00:49,942 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:00:49,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:49,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1036447535, now seen corresponding path program 1 times [2023-11-25 00:00:49,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:49,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276476750] [2023-11-25 00:00:49,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:49,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:50,202 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-25 00:00:50,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:50,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276476750] [2023-11-25 00:00:50,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276476750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:50,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:50,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:00:50,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265281382] [2023-11-25 00:00:50,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:50,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:00:50,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:50,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:00:50,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:00:50,205 INFO L87 Difference]: Start difference. First operand 11034 states and 42665 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) 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-25 00:00:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:50,453 INFO L93 Difference]: Finished difference Result 7610 states and 28697 transitions. [2023-11-25 00:00:50,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:00:50,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) 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-25 00:00:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:50,488 INFO L225 Difference]: With dead ends: 7610 [2023-11-25 00:00:50,488 INFO L226 Difference]: Without dead ends: 6834 [2023-11-25 00:00:50,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:00:50,489 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 176 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:50,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 84 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:00:50,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6834 states. [2023-11-25 00:00:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6834 to 6834. [2023-11-25 00:00:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6834 states, 6833 states have (on average 3.785306600321967) internal successors, (25865), 6833 states have internal predecessors, (25865), 0 states have call successors, (0), 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-25 00:00:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6834 states to 6834 states and 25865 transitions. [2023-11-25 00:00:50,944 INFO L78 Accepts]: Start accepts. Automaton has 6834 states and 25865 transitions. Word has length 26 [2023-11-25 00:00:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:50,945 INFO L495 AbstractCegarLoop]: Abstraction has 6834 states and 25865 transitions. [2023-11-25 00:00:50,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) 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-25 00:00:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 6834 states and 25865 transitions. [2023-11-25 00:00:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-25 00:00:50,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:50,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:00:50,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-25 00:00:50,972 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:00:50,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash -713064403, now seen corresponding path program 1 times [2023-11-25 00:00:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:50,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647839656] [2023-11-25 00:00:50,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:50,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:51,276 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-25 00:00:51,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:51,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647839656] [2023-11-25 00:00:51,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647839656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:51,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:51,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-25 00:00:51,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334692638] [2023-11-25 00:00:51,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:51,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-25 00:00:51,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:51,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-25 00:00:51,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:00:51,278 INFO L87 Difference]: Start difference. First operand 6834 states and 25865 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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-25 00:00:51,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:51,540 INFO L93 Difference]: Finished difference Result 5890 states and 22537 transitions. [2023-11-25 00:00:51,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:00:51,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2023-11-25 00:00:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:51,569 INFO L225 Difference]: With dead ends: 5890 [2023-11-25 00:00:51,569 INFO L226 Difference]: Without dead ends: 5714 [2023-11-25 00:00:51,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-11-25 00:00:51,571 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 214 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:51,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 67 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:00:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5714 states. [2023-11-25 00:00:51,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5714 to 5714. [2023-11-25 00:00:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5714 states, 5713 states have (on average 3.8412392788377385) internal successors, (21945), 5713 states have internal predecessors, (21945), 0 states have call successors, (0), 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-25 00:00:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5714 states to 5714 states and 21945 transitions. [2023-11-25 00:00:51,947 INFO L78 Accepts]: Start accepts. Automaton has 5714 states and 21945 transitions. Word has length 31 [2023-11-25 00:00:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:51,948 INFO L495 AbstractCegarLoop]: Abstraction has 5714 states and 21945 transitions. [2023-11-25 00:00:51,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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-25 00:00:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 5714 states and 21945 transitions. [2023-11-25 00:00:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-25 00:00:51,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:51,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:00:51,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-25 00:00:51,982 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:00:51,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:51,983 INFO L85 PathProgramCache]: Analyzing trace with hash 912123101, now seen corresponding path program 1 times [2023-11-25 00:00:51,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:51,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441386523] [2023-11-25 00:00:51,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:51,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:52,430 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-25 00:00:52,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:52,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441386523] [2023-11-25 00:00:52,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441386523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:52,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:52,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-25 00:00:52,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877555746] [2023-11-25 00:00:52,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:52,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:00:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:52,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:00:52,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:00:52,435 INFO L87 Difference]: Start difference. First operand 5714 states and 21945 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:00:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:52,686 INFO L93 Difference]: Finished difference Result 8074 states and 30619 transitions. [2023-11-25 00:00:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:00:52,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-11-25 00:00:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:52,708 INFO L225 Difference]: With dead ends: 8074 [2023-11-25 00:00:52,708 INFO L226 Difference]: Without dead ends: 4004 [2023-11-25 00:00:52,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-25 00:00:52,711 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:52,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 117 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:00:52,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4004 states. [2023-11-25 00:00:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4004 to 4004. [2023-11-25 00:00:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4004 states, 4003 states have (on average 3.709717711716213) internal successors, (14850), 4003 states have internal predecessors, (14850), 0 states have call successors, (0), 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-25 00:00:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4004 states to 4004 states and 14850 transitions. [2023-11-25 00:00:53,019 INFO L78 Accepts]: Start accepts. Automaton has 4004 states and 14850 transitions. Word has length 36 [2023-11-25 00:00:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:53,020 INFO L495 AbstractCegarLoop]: Abstraction has 4004 states and 14850 transitions. [2023-11-25 00:00:53,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:00:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4004 states and 14850 transitions. [2023-11-25 00:00:53,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-25 00:00:53,040 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:53,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:00:53,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-25 00:00:53,041 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:00:53,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2059391071, now seen corresponding path program 2 times [2023-11-25 00:00:53,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:53,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770950124] [2023-11-25 00:00:53,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:53,451 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-25 00:00:53,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:53,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770950124] [2023-11-25 00:00:53,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770950124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:53,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:53,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-25 00:00:53,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786220470] [2023-11-25 00:00:53,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:53,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:00:53,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:53,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:00:53,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:00:53,455 INFO L87 Difference]: Start difference. First operand 4004 states and 14850 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:00:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:53,758 INFO L93 Difference]: Finished difference Result 5828 states and 21542 transitions. [2023-11-25 00:00:53,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:00:53,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-11-25 00:00:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:53,787 INFO L225 Difference]: With dead ends: 5828 [2023-11-25 00:00:53,788 INFO L226 Difference]: Without dead ends: 4724 [2023-11-25 00:00:53,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:00:53,789 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 82 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:53,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 124 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:00:53,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4724 states. [2023-11-25 00:00:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4724 to 3492. [2023-11-25 00:00:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3492 states, 3491 states have (on average 3.6488112288742482) internal successors, (12738), 3491 states have internal predecessors, (12738), 0 states have call successors, (0), 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-25 00:00:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 3492 states and 12738 transitions. [2023-11-25 00:00:53,959 INFO L78 Accepts]: Start accepts. Automaton has 3492 states and 12738 transitions. Word has length 36 [2023-11-25 00:00:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:53,960 INFO L495 AbstractCegarLoop]: Abstraction has 3492 states and 12738 transitions. [2023-11-25 00:00:53,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:00:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3492 states and 12738 transitions. [2023-11-25 00:00:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-25 00:00:53,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:53,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:00:53,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-25 00:00:53,974 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:00:53,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash -473087175, now seen corresponding path program 3 times [2023-11-25 00:00:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:53,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123254901] [2023-11-25 00:00:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:54,347 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-25 00:00:54,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123254901] [2023-11-25 00:00:54,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123254901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:54,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:54,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-25 00:00:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604841653] [2023-11-25 00:00:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:54,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-25 00:00:54,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:54,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-25 00:00:54,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:00:54,351 INFO L87 Difference]: Start difference. First operand 3492 states and 12738 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:00:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:54,684 INFO L93 Difference]: Finished difference Result 5764 states and 21158 transitions. [2023-11-25 00:00:54,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-25 00:00:54,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-11-25 00:00:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:54,699 INFO L225 Difference]: With dead ends: 5764 [2023-11-25 00:00:54,700 INFO L226 Difference]: Without dead ends: 2510 [2023-11-25 00:00:54,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-25 00:00:54,702 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 105 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:54,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 180 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:00:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2023-11-25 00:00:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2254. [2023-11-25 00:00:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2253 states have (on average 3.6040834442964935) internal successors, (8120), 2253 states have internal predecessors, (8120), 0 states have call successors, (0), 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-25 00:00:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 8120 transitions. [2023-11-25 00:00:54,803 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 8120 transitions. Word has length 36 [2023-11-25 00:00:54,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:54,803 INFO L495 AbstractCegarLoop]: Abstraction has 2254 states and 8120 transitions. [2023-11-25 00:00:54,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:00:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 8120 transitions. [2023-11-25 00:00:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-25 00:00:54,812 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:54,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:00:54,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-25 00:00:54,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:00:54,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:54,816 INFO L85 PathProgramCache]: Analyzing trace with hash -760075141, now seen corresponding path program 4 times [2023-11-25 00:00:54,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:54,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162468866] [2023-11-25 00:00:54,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:54,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:56,301 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-25 00:00:56,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:56,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162468866] [2023-11-25 00:00:56,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162468866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:56,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:56,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-25 00:00:56,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931112959] [2023-11-25 00:00:56,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:56,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-25 00:00:56,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:56,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-25 00:00:56,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-25 00:00:56,305 INFO L87 Difference]: Start difference. First operand 2254 states and 8120 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:00:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:56,897 INFO L93 Difference]: Finished difference Result 4230 states and 15244 transitions. [2023-11-25 00:00:56,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-25 00:00:56,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-11-25 00:00:56,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:56,910 INFO L225 Difference]: With dead ends: 4230 [2023-11-25 00:00:56,910 INFO L226 Difference]: Without dead ends: 2490 [2023-11-25 00:00:56,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-11-25 00:00:56,913 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 109 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:56,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 367 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-25 00:00:56,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2023-11-25 00:00:56,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2234. [2023-11-25 00:00:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 2233 states have (on average 3.599641737572772) internal successors, (8038), 2233 states have internal predecessors, (8038), 0 states have call successors, (0), 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-25 00:00:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 8038 transitions. [2023-11-25 00:00:56,991 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 8038 transitions. Word has length 36 [2023-11-25 00:00:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:56,992 INFO L495 AbstractCegarLoop]: Abstraction has 2234 states and 8038 transitions. [2023-11-25 00:00:56,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:00:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 8038 transitions. [2023-11-25 00:00:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-25 00:00:56,999 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:56,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:00:56,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-25 00:00:57,003 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:00:57,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:57,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1126863701, now seen corresponding path program 5 times [2023-11-25 00:00:57,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:57,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180561214] [2023-11-25 00:00:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:57,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:57,421 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-25 00:00:57,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180561214] [2023-11-25 00:00:57,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180561214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:57,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:57,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-25 00:00:57,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802802727] [2023-11-25 00:00:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:57,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-25 00:00:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:57,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-25 00:00:57,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-25 00:00:57,425 INFO L87 Difference]: Start difference. First operand 2234 states and 8038 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:00:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:57,752 INFO L93 Difference]: Finished difference Result 3210 states and 11510 transitions. [2023-11-25 00:00:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-25 00:00:57,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-11-25 00:00:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:57,763 INFO L225 Difference]: With dead ends: 3210 [2023-11-25 00:00:57,764 INFO L226 Difference]: Without dead ends: 1754 [2023-11-25 00:00:57,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-11-25 00:00:57,765 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 112 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:57,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 197 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:00:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2023-11-25 00:00:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1626. [2023-11-25 00:00:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1625 states have (on average 3.4621538461538464) internal successors, (5626), 1625 states have internal predecessors, (5626), 0 states have call successors, (0), 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-25 00:00:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 5626 transitions. [2023-11-25 00:00:57,897 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 5626 transitions. Word has length 36 [2023-11-25 00:00:57,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:57,898 INFO L495 AbstractCegarLoop]: Abstraction has 1626 states and 5626 transitions. [2023-11-25 00:00:57,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:00:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 5626 transitions. [2023-11-25 00:00:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-25 00:00:57,903 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:57,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:00:57,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-25 00:00:57,904 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:00:57,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1791578809, now seen corresponding path program 6 times [2023-11-25 00:00:57,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:57,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860314440] [2023-11-25 00:00:57,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:57,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:59,100 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-25 00:00:59,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:59,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860314440] [2023-11-25 00:00:59,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860314440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:59,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:59,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-25 00:00:59,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075343528] [2023-11-25 00:00:59,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:59,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-25 00:00:59,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:59,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-25 00:00:59,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-25 00:00:59,103 INFO L87 Difference]: Start difference. First operand 1626 states and 5626 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:00:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:00:59,563 INFO L93 Difference]: Finished difference Result 2218 states and 7658 transitions. [2023-11-25 00:00:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-25 00:00:59,564 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-11-25 00:00:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:00:59,570 INFO L225 Difference]: With dead ends: 2218 [2023-11-25 00:00:59,570 INFO L226 Difference]: Without dead ends: 1526 [2023-11-25 00:00:59,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-11-25 00:00:59,572 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 105 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:00:59,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 258 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-25 00:00:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2023-11-25 00:00:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1526. [2023-11-25 00:00:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 3.5095081967213115) internal successors, (5352), 1525 states have internal predecessors, (5352), 0 states have call successors, (0), 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-25 00:00:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 5352 transitions. [2023-11-25 00:00:59,622 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 5352 transitions. Word has length 36 [2023-11-25 00:00:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:00:59,622 INFO L495 AbstractCegarLoop]: Abstraction has 1526 states and 5352 transitions. [2023-11-25 00:00:59,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:00:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 5352 transitions. [2023-11-25 00:00:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-25 00:00:59,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:00:59,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:00:59,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-25 00:00:59,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:00:59,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:00:59,628 INFO L85 PathProgramCache]: Analyzing trace with hash -605184205, now seen corresponding path program 7 times [2023-11-25 00:00:59,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:00:59,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257570897] [2023-11-25 00:00:59,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:00:59,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:00:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:00:59,960 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-25 00:00:59,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:00:59,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257570897] [2023-11-25 00:00:59,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257570897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:00:59,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:00:59,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-25 00:00:59,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956906677] [2023-11-25 00:00:59,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:00:59,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-25 00:00:59,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:00:59,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-25 00:00:59,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:00:59,963 INFO L87 Difference]: Start difference. First operand 1526 states and 5352 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:01:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:00,215 INFO L93 Difference]: Finished difference Result 2246 states and 7864 transitions. [2023-11-25 00:01:00,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-25 00:01:00,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-11-25 00:01:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:00,221 INFO L225 Difference]: With dead ends: 2246 [2023-11-25 00:01:00,221 INFO L226 Difference]: Without dead ends: 1374 [2023-11-25 00:01:00,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-25 00:01:00,222 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 84 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:00,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 176 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:01:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2023-11-25 00:01:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2023-11-25 00:01:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1373 states have (on average 3.466860888565186) internal successors, (4760), 1373 states have internal predecessors, (4760), 0 states have call successors, (0), 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-25 00:01:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 4760 transitions. [2023-11-25 00:01:00,264 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 4760 transitions. Word has length 36 [2023-11-25 00:01:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:00,265 INFO L495 AbstractCegarLoop]: Abstraction has 1374 states and 4760 transitions. [2023-11-25 00:01:00,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:01:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 4760 transitions. [2023-11-25 00:01:00,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-25 00:01:00,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:00,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:01:00,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-25 00:01:00,270 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:01:00,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:00,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1737935141, now seen corresponding path program 8 times [2023-11-25 00:01:00,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:00,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208916714] [2023-11-25 00:01:00,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:00,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:01:01,301 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-25 00:01:01,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:01:01,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208916714] [2023-11-25 00:01:01,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208916714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:01:01,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:01:01,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-25 00:01:01,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094502001] [2023-11-25 00:01:01,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:01:01,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-25 00:01:01,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:01:01,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-25 00:01:01,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:01:01,304 INFO L87 Difference]: Start difference. First operand 1374 states and 4760 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:01:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:01:01,668 INFO L93 Difference]: Finished difference Result 1838 states and 6312 transitions. [2023-11-25 00:01:01,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-25 00:01:01,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2023-11-25 00:01:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:01:01,673 INFO L225 Difference]: With dead ends: 1838 [2023-11-25 00:01:01,673 INFO L226 Difference]: Without dead ends: 870 [2023-11-25 00:01:01,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-25 00:01:01,674 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 76 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:01:01,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 201 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:01:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2023-11-25 00:01:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2023-11-25 00:01:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 3.240506329113924) internal successors, (2816), 869 states have internal predecessors, (2816), 0 states have call successors, (0), 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-25 00:01:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 2816 transitions. [2023-11-25 00:01:01,701 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 2816 transitions. Word has length 36 [2023-11-25 00:01:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:01:01,701 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 2816 transitions. [2023-11-25 00:01:01,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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-25 00:01:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 2816 transitions. [2023-11-25 00:01:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-25 00:01:01,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:01:01,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:01:01,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-25 00:01:01,705 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-25 00:01:01,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:01:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash -130652453, now seen corresponding path program 9 times [2023-11-25 00:01:01,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:01:01,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178793676] [2023-11-25 00:01:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:01:01,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:01:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-25 00:01:01,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-25 00:01:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-25 00:01:01,834 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-25 00:01:01,835 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-25 00:01:01,836 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-25 00:01:01,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-25 00:01:01,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-25 00:01:01,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-25 00:01:01,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-25 00:01:01,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-25 00:01:01,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-25 00:01:01,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-25 00:01:01,845 INFO L445 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1] [2023-11-25 00:01:01,850 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-25 00:01:01,850 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-25 00:01:01,939 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-25 00:01:01,941 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-25 00:01:01,944 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-25 00:01:01,952 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-25 00:01:01,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 12:01:01 BasicIcfg [2023-11-25 00:01:01,996 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-25 00:01:01,997 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-25 00:01:01,997 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-25 00:01:01,997 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-25 00:01:01,998 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:00:39" (3/4) ... [2023-11-25 00:01:01,999 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-25 00:01:02,045 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-25 00:01:02,049 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-25 00:01:02,050 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-25 00:01:02,050 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-25 00:01:02,139 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/witness.graphml [2023-11-25 00:01:02,139 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-25 00:01:02,140 INFO L158 Benchmark]: Toolchain (without parser) took 24733.48ms. Allocated memory was 163.6MB in the beginning and 8.6GB in the end (delta: 8.5GB). Free memory was 130.4MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 980.9MB. Max. memory is 16.1GB. [2023-11-25 00:01:02,140 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 130.0MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-25 00:01:02,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 660.22ms. Allocated memory is still 163.6MB. Free memory was 129.8MB in the beginning and 106.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-25 00:01:02,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.66ms. Allocated memory is still 163.6MB. Free memory was 106.7MB in the beginning and 104.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-25 00:01:02,142 INFO L158 Benchmark]: Boogie Preprocessor took 59.16ms. Allocated memory is still 163.6MB. Free memory was 104.1MB in the beginning and 102.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-25 00:01:02,144 INFO L158 Benchmark]: RCFGBuilder took 1014.43ms. Allocated memory is still 163.6MB. Free memory was 102.0MB in the beginning and 120.9MB in the end (delta: -18.9MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2023-11-25 00:01:02,145 INFO L158 Benchmark]: TraceAbstraction took 22752.86ms. Allocated memory was 163.6MB in the beginning and 8.6GB in the end (delta: 8.5GB). Free memory was 119.8MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 950.0MB. Max. memory is 16.1GB. [2023-11-25 00:01:02,145 INFO L158 Benchmark]: Witness Printer took 142.66ms. Allocated memory is still 8.6GB. Free memory was 7.6GB in the beginning and 7.6GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-25 00:01:02,148 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.31ms. Allocated memory is still 130.0MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 660.22ms. Allocated memory is still 163.6MB. Free memory was 129.8MB in the beginning and 106.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.66ms. Allocated memory is still 163.6MB. Free memory was 106.7MB in the beginning and 104.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.16ms. Allocated memory is still 163.6MB. Free memory was 104.1MB in the beginning and 102.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1014.43ms. Allocated memory is still 163.6MB. Free memory was 102.0MB in the beginning and 120.9MB in the end (delta: -18.9MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22752.86ms. Allocated memory was 163.6MB in the beginning and 8.6GB in the end (delta: 8.5GB). Free memory was 119.8MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 950.0MB. Max. memory is 16.1GB. * Witness Printer took 142.66ms. Allocated memory is still 8.6GB. Free memory was 7.6GB in the beginning and 7.6GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~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 Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - 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 Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1365; [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1366; [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1367; [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1368; [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=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$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=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$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=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$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=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=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=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=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=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=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 847]: 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: 853]: 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: 851]: 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: 849]: 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, 81 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 22.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.3s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1357 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1357 mSDsluCounter, 1933 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1531 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2067 IncrementalHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 402 mSDtfsCounter, 2067 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27554occurred in iteration=0, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 1872 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 379 ConstructedInterpolants, 0 QuantifiedInterpolants, 3425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-25 00:01:02,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e221751-5951-45d7-8e77-12b98561b6c1/bin/utaipan-verify-SwPr7d2a91/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