./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX --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 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:10:13,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:10:13,610 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-12 00:10:13,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:10:13,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:10:13,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:10:13,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:10:13,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:10:13,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:10:13,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:10:13,690 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:10:13,692 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:10:13,692 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:10:13,694 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:10:13,695 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:10:13,695 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:10:13,696 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:10:13,696 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:10:13,697 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:10:13,697 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:10:13,698 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:10:13,698 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:10:13,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:10:13,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:10:13,701 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:10:13,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:10:13,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:10:13,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:10:13,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:10:13,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:10:13,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:10:13,705 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:10:13,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:10:13,705 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:10:13,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:10:13,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:10:13,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:10:13,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:10:13,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:10:13,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:10:13,708 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:10:13,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:10:13,708 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:10:13,709 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:10:13,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:10:13,710 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_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/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_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX 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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af [2023-11-12 00:10:14,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:10:14,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:10:14,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:10:14,078 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:10:14,078 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:10:14,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-11-12 00:10:17,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:10:17,857 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:10:17,869 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-11-12 00:10:17,895 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/data/257058c41/e6bc438bc6564327be3df78ff6213910/FLAGf2594f316 [2023-11-12 00:10:17,910 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/data/257058c41/e6bc438bc6564327be3df78ff6213910 [2023-11-12 00:10:17,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:10:17,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:10:17,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:10:17,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:10:17,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:10:17,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:10:17" (1/1) ... [2023-11-12 00:10:17,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1152b6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:17, skipping insertion in model container [2023-11-12 00:10:17,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:10:17" (1/1) ... [2023-11-12 00:10:17,974 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:10:18,161 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_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-12 00:10:18,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:10:18,402 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:10:18,420 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_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-12 00:10:18,521 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:10:18,571 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 00:10:18,571 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 00:10:18,579 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:10:18,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:18 WrapperNode [2023-11-12 00:10:18,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:10:18,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:10:18,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:10:18,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:10:18,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:18" (1/1) ... [2023-11-12 00:10:18,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:18" (1/1) ... [2023-11-12 00:10:18,681 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-11-12 00:10:18,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:10:18,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:10:18,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:10:18,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:10:18,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:18" (1/1) ... [2023-11-12 00:10:18,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:18" (1/1) ... [2023-11-12 00:10:18,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:18" (1/1) ... [2023-11-12 00:10:18,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:18" (1/1) ... [2023-11-12 00:10:18,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:18" (1/1) ... [2023-11-12 00:10:18,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:18" (1/1) ... [2023-11-12 00:10:18,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:18" (1/1) ... [2023-11-12 00:10:18,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:18" (1/1) ... [2023-11-12 00:10:18,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:10:18,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:10:18,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:10:18,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:10:18,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:18" (1/1) ... [2023-11-12 00:10:18,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:10:18,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:10:18,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:10:18,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:10:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:10:18,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 00:10:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:10:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:10:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:10:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 00:10:18,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 00:10:18,856 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 00:10:18,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 00:10:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 00:10:18,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 00:10:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-12 00:10:18,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-12 00:10:18,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:10:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 00:10:18,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:10:18,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:10:18,860 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 00:10:19,043 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:10:19,045 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:10:19,428 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:10:19,594 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:10:19,595 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 00:10:19,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:10:19 BoogieIcfgContainer [2023-11-12 00:10:19,597 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:10:19,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:10:19,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:10:19,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:10:19,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:10:17" (1/3) ... [2023-11-12 00:10:19,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144a6f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:10:19, skipping insertion in model container [2023-11-12 00:10:19,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:10:18" (2/3) ... [2023-11-12 00:10:19,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144a6f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:10:19, skipping insertion in model container [2023-11-12 00:10:19,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:10:19" (3/3) ... [2023-11-12 00:10:19,608 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2023-11-12 00:10:19,617 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 00:10:19,629 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:10:19,629 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 00:10:19,630 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 00:10:19,702 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 00:10:19,742 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-12 00:10:19,758 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 280 flow [2023-11-12 00:10:19,761 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 280 flow [2023-11-12 00:10:19,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 280 flow [2023-11-12 00:10:19,826 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-11-12 00:10:19,826 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 00:10:19,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-12 00:10:19,837 INFO L119 LiptonReduction]: Number of co-enabled transitions 3218 [2023-11-12 00:10:27,580 INFO L134 LiptonReduction]: Checked pairs total: 8732 [2023-11-12 00:10:27,580 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-11-12 00:10:27,590 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 84 flow [2023-11-12 00:10:27,919 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3410 states, 3407 states have (on average 3.97006163780452) internal successors, (13526), 3409 states have internal predecessors, (13526), 0 states have call successors, (0), 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-12 00:10:27,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:10:27,955 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;@5b0e78b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:10:27,955 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-12 00:10:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 3410 states, 3407 states have (on average 3.97006163780452) internal successors, (13526), 3409 states have internal predecessors, (13526), 0 states have call successors, (0), 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-12 00:10:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:10:27,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:27,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:27,981 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:27,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:27,987 INFO L85 PathProgramCache]: Analyzing trace with hash -135950822, now seen corresponding path program 1 times [2023-11-12 00:10:27,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:27,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756924643] [2023-11-12 00:10:27,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:28,628 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-12 00:10:28,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:28,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756924643] [2023-11-12 00:10:28,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756924643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:28,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:28,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:10:28,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63960985] [2023-11-12 00:10:28,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:28,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:10:28,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:10:28,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:10:28,686 INFO L87 Difference]: Start difference. First operand has 3410 states, 3407 states have (on average 3.97006163780452) internal successors, (13526), 3409 states have internal predecessors, (13526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:28,881 INFO L93 Difference]: Finished difference Result 2770 states and 10634 transitions. [2023-11-12 00:10:28,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:10:28,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 00:10:28,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:28,939 INFO L225 Difference]: With dead ends: 2770 [2023-11-12 00:10:28,940 INFO L226 Difference]: Without dead ends: 2650 [2023-11-12 00:10:28,942 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-12 00:10:28,949 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:28,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 10 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2023-11-12 00:10:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2023-11-12 00:10:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2650 states, 2649 states have (on average 3.861079652699132) internal successors, (10228), 2649 states have internal predecessors, (10228), 0 states have call successors, (0), 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-12 00:10:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2023-11-12 00:10:29,282 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2023-11-12 00:10:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:29,283 INFO L495 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2023-11-12 00:10:29,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2023-11-12 00:10:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:10:29,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:29,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:29,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:10:29,289 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:29,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:29,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1398718368, now seen corresponding path program 1 times [2023-11-12 00:10:29,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:29,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215540211] [2023-11-12 00:10:29,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:29,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:29,638 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-12 00:10:29,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:29,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215540211] [2023-11-12 00:10:29,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215540211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:29,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:29,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:10:29,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958549024] [2023-11-12 00:10:29,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:29,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:10:29,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:29,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:10:29,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:10:29,643 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:29,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:29,770 INFO L93 Difference]: Finished difference Result 2610 states and 10046 transitions. [2023-11-12 00:10:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:10:29,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-12 00:10:29,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:29,805 INFO L225 Difference]: With dead ends: 2610 [2023-11-12 00:10:29,805 INFO L226 Difference]: Without dead ends: 2610 [2023-11-12 00:10:29,806 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-12 00:10:29,807 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:29,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:29,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2023-11-12 00:10:29,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2023-11-12 00:10:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2609 states have (on average 3.8505174396320427) internal successors, (10046), 2609 states have internal predecessors, (10046), 0 states have call successors, (0), 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-12 00:10:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10046 transitions. [2023-11-12 00:10:30,040 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 10046 transitions. Word has length 11 [2023-11-12 00:10:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:30,041 INFO L495 AbstractCegarLoop]: Abstraction has 2610 states and 10046 transitions. [2023-11-12 00:10:30,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 10046 transitions. [2023-11-12 00:10:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:10:30,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:30,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:30,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:10:30,058 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:30,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash 410595002, now seen corresponding path program 1 times [2023-11-12 00:10:30,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:30,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133003807] [2023-11-12 00:10:30,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:30,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:30,428 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-12 00:10:30,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:30,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133003807] [2023-11-12 00:10:30,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133003807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:30,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:30,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:10:30,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348732149] [2023-11-12 00:10:30,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:30,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:10:30,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:30,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:10:30,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:10:30,433 INFO L87 Difference]: Start difference. First operand 2610 states and 10046 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:30,562 INFO L93 Difference]: Finished difference Result 2450 states and 9358 transitions. [2023-11-12 00:10:30,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:10:30,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-12 00:10:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:30,594 INFO L225 Difference]: With dead ends: 2450 [2023-11-12 00:10:30,594 INFO L226 Difference]: Without dead ends: 2450 [2023-11-12 00:10:30,594 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-12 00:10:30,596 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:30,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 9 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2023-11-12 00:10:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2023-11-12 00:10:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2449 states have (on average 3.8211514904042465) internal successors, (9358), 2449 states have internal predecessors, (9358), 0 states have call successors, (0), 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-12 00:10:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions. [2023-11-12 00:10:30,729 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 12 [2023-11-12 00:10:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:30,730 INFO L495 AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions. [2023-11-12 00:10:30,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions. [2023-11-12 00:10:30,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:10:30,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:30,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:30,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:10:30,734 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:30,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:30,734 INFO L85 PathProgramCache]: Analyzing trace with hash -156459605, now seen corresponding path program 1 times [2023-11-12 00:10:30,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:30,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414305097] [2023-11-12 00:10:30,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:30,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:31,433 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-12 00:10:31,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:31,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414305097] [2023-11-12 00:10:31,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414305097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:31,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:31,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:10:31,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518310095] [2023-11-12 00:10:31,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:31,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:10:31,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:31,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:10:31,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:10:31,436 INFO L87 Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:31,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:31,602 INFO L93 Difference]: Finished difference Result 2418 states and 9214 transitions. [2023-11-12 00:10:31,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:10:31,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-12 00:10:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:31,634 INFO L225 Difference]: With dead ends: 2418 [2023-11-12 00:10:31,635 INFO L226 Difference]: Without dead ends: 2418 [2023-11-12 00:10:31,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:10:31,641 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:31,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 13 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2023-11-12 00:10:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2023-11-12 00:10:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2417 states have (on average 3.812163839470418) internal successors, (9214), 2417 states have internal predecessors, (9214), 0 states have call successors, (0), 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-12 00:10:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions. [2023-11-12 00:10:31,766 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 13 [2023-11-12 00:10:31,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:31,768 INFO L495 AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions. [2023-11-12 00:10:31,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions. [2023-11-12 00:10:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:10:31,772 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:31,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:31,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:10:31,773 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:31,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1612214626, now seen corresponding path program 1 times [2023-11-12 00:10:31,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:31,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722266091] [2023-11-12 00:10:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:31,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:32,603 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-12 00:10:32,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:32,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722266091] [2023-11-12 00:10:32,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722266091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:32,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:32,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:10:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117847114] [2023-11-12 00:10:32,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:32,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:10:32,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:32,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:10:32,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:10:32,609 INFO L87 Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:32,839 INFO L93 Difference]: Finished difference Result 2786 states and 10534 transitions. [2023-11-12 00:10:32,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:10:32,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-12 00:10:32,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:32,895 INFO L225 Difference]: With dead ends: 2786 [2023-11-12 00:10:32,895 INFO L226 Difference]: Without dead ends: 2786 [2023-11-12 00:10:32,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:10:32,896 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:32,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 21 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:10:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2023-11-12 00:10:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2786. [2023-11-12 00:10:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2786 states, 2785 states have (on average 3.7824057450628366) internal successors, (10534), 2785 states have internal predecessors, (10534), 0 states have call successors, (0), 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-12 00:10:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 10534 transitions. [2023-11-12 00:10:33,038 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 10534 transitions. Word has length 14 [2023-11-12 00:10:33,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:33,039 INFO L495 AbstractCegarLoop]: Abstraction has 2786 states and 10534 transitions. [2023-11-12 00:10:33,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 10534 transitions. [2023-11-12 00:10:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:10:33,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:33,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:33,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:10:33,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:33,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:33,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1274427329, now seen corresponding path program 1 times [2023-11-12 00:10:33,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:33,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335882416] [2023-11-12 00:10:33,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:33,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:33,375 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-12 00:10:33,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:33,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335882416] [2023-11-12 00:10:33,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335882416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:33,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:33,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:10:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190389473] [2023-11-12 00:10:33,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:33,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:10:33,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:33,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:10:33,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:10:33,378 INFO L87 Difference]: Start difference. First operand 2786 states and 10534 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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-12 00:10:33,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:33,487 INFO L93 Difference]: Finished difference Result 2138 states and 7294 transitions. [2023-11-12 00:10:33,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:10:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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-12 00:10:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:33,502 INFO L225 Difference]: With dead ends: 2138 [2023-11-12 00:10:33,502 INFO L226 Difference]: Without dead ends: 2138 [2023-11-12 00:10:33,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:10:33,504 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:33,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 10 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2023-11-12 00:10:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2138. [2023-11-12 00:10:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 2137 states have (on average 3.4131960692559664) internal successors, (7294), 2137 states have internal predecessors, (7294), 0 states have call successors, (0), 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-12 00:10:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 7294 transitions. [2023-11-12 00:10:33,609 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 7294 transitions. Word has length 16 [2023-11-12 00:10:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:33,610 INFO L495 AbstractCegarLoop]: Abstraction has 2138 states and 7294 transitions. [2023-11-12 00:10:33,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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-12 00:10:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 7294 transitions. [2023-11-12 00:10:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:10:33,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:33,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:33,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:10:33,617 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:33,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2021928783, now seen corresponding path program 1 times [2023-11-12 00:10:33,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:33,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871241466] [2023-11-12 00:10:33,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:33,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:33,896 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-12 00:10:33,897 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:33,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871241466] [2023-11-12 00:10:33,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871241466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:33,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:33,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:10:33,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128973117] [2023-11-12 00:10:33,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:33,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:10:33,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:33,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:10:33,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:10:33,901 INFO L87 Difference]: Start difference. First operand 2138 states and 7294 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:34,037 INFO L93 Difference]: Finished difference Result 1379 states and 4258 transitions. [2023-11-12 00:10:34,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:10:34,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-12 00:10:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:34,044 INFO L225 Difference]: With dead ends: 1379 [2023-11-12 00:10:34,045 INFO L226 Difference]: Without dead ends: 1379 [2023-11-12 00:10:34,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:10:34,046 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 36 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:34,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 15 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:34,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2023-11-12 00:10:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1379. [2023-11-12 00:10:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1378 states have (on average 3.0899854862119014) internal successors, (4258), 1378 states have internal predecessors, (4258), 0 states have call successors, (0), 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-12 00:10:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 4258 transitions. [2023-11-12 00:10:34,105 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 4258 transitions. Word has length 17 [2023-11-12 00:10:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:34,106 INFO L495 AbstractCegarLoop]: Abstraction has 1379 states and 4258 transitions. [2023-11-12 00:10:34,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 4258 transitions. [2023-11-12 00:10:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 00:10:34,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:34,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:34,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:10:34,115 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:34,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:34,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1906681656, now seen corresponding path program 1 times [2023-11-12 00:10:34,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:34,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804563847] [2023-11-12 00:10:34,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:34,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:10:34,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:34,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804563847] [2023-11-12 00:10:34,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804563847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:34,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:34,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:10:34,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357856620] [2023-11-12 00:10:34,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:34,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:10:34,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:34,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:10:34,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:10:34,414 INFO L87 Difference]: Start difference. First operand 1379 states and 4258 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:34,567 INFO L93 Difference]: Finished difference Result 1078 states and 3355 transitions. [2023-11-12 00:10:34,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:10:34,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-12 00:10:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:34,572 INFO L225 Difference]: With dead ends: 1078 [2023-11-12 00:10:34,573 INFO L226 Difference]: Without dead ends: 1078 [2023-11-12 00:10:34,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:10:34,574 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 59 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:34,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 20 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:34,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2023-11-12 00:10:34,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 934. [2023-11-12 00:10:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 3.0943193997856375) internal successors, (2887), 933 states have internal predecessors, (2887), 0 states have call successors, (0), 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-12 00:10:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 2887 transitions. [2023-11-12 00:10:34,612 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 2887 transitions. Word has length 20 [2023-11-12 00:10:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:34,613 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 2887 transitions. [2023-11-12 00:10:34,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 2887 transitions. [2023-11-12 00:10:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:10:34,617 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:34,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:34,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 00:10:34,617 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:34,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2010711046, now seen corresponding path program 1 times [2023-11-12 00:10:34,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:34,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979045117] [2023-11-12 00:10:34,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:34,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:34,865 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-12 00:10:34,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:34,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979045117] [2023-11-12 00:10:34,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979045117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:34,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:34,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:10:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31970654] [2023-11-12 00:10:34,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:34,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:10:34,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:34,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:10:34,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:10:34,868 INFO L87 Difference]: Start difference. First operand 934 states and 2887 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:35,009 INFO L93 Difference]: Finished difference Result 1216 states and 3671 transitions. [2023-11-12 00:10:35,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:10:35,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-12 00:10:35,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:35,014 INFO L225 Difference]: With dead ends: 1216 [2023-11-12 00:10:35,014 INFO L226 Difference]: Without dead ends: 937 [2023-11-12 00:10:35,015 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-12 00:10:35,015 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:35,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 21 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2023-11-12 00:10:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 934. [2023-11-12 00:10:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 3.0117899249732045) internal successors, (2810), 933 states have internal predecessors, (2810), 0 states have call successors, (0), 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-12 00:10:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 2810 transitions. [2023-11-12 00:10:35,052 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 2810 transitions. Word has length 23 [2023-11-12 00:10:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:35,052 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 2810 transitions. [2023-11-12 00:10:35,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 2810 transitions. [2023-11-12 00:10:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:10:35,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:35,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:35,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:10:35,057 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:35,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1408533910, now seen corresponding path program 2 times [2023-11-12 00:10:35,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:35,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947628938] [2023-11-12 00:10:35,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:35,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:35,382 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-12 00:10:35,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:35,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947628938] [2023-11-12 00:10:35,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947628938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:35,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:35,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:10:35,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823316775] [2023-11-12 00:10:35,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:35,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:10:35,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:35,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:10:35,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:10:35,384 INFO L87 Difference]: Start difference. First operand 934 states and 2810 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:35,541 INFO L93 Difference]: Finished difference Result 885 states and 2714 transitions. [2023-11-12 00:10:35,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:10:35,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-12 00:10:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:35,544 INFO L225 Difference]: With dead ends: 885 [2023-11-12 00:10:35,545 INFO L226 Difference]: Without dead ends: 474 [2023-11-12 00:10:35,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:10:35,546 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 63 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:35,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 19 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-11-12 00:10:35,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 442. [2023-11-12 00:10:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 2.8458049886621315) internal successors, (1255), 441 states have internal predecessors, (1255), 0 states have call successors, (0), 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-12 00:10:35,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1255 transitions. [2023-11-12 00:10:35,563 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1255 transitions. Word has length 23 [2023-11-12 00:10:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:35,563 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 1255 transitions. [2023-11-12 00:10:35,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:10:35,563 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1255 transitions. [2023-11-12 00:10:35,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:10:35,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:35,565 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] [2023-11-12 00:10:35,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 00:10:35,566 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:35,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1784373555, now seen corresponding path program 1 times [2023-11-12 00:10:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:35,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950224946] [2023-11-12 00:10:35,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:35,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:35,853 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-12 00:10:35,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:35,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950224946] [2023-11-12 00:10:35,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950224946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:35,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:35,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:10:35,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068411875] [2023-11-12 00:10:35,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:35,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:10:35,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:35,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:10:35,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:10:35,856 INFO L87 Difference]: Start difference. First operand 442 states and 1255 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-12 00:10:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:35,981 INFO L93 Difference]: Finished difference Result 564 states and 1583 transitions. [2023-11-12 00:10:35,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:10:35,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2023-11-12 00:10:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:35,983 INFO L225 Difference]: With dead ends: 564 [2023-11-12 00:10:35,983 INFO L226 Difference]: Without dead ends: 214 [2023-11-12 00:10:35,983 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-12 00:10:35,984 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:35,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 20 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:10:35,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-11-12 00:10:35,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2023-11-12 00:10:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.5492957746478875) internal successors, (543), 213 states have internal predecessors, (543), 0 states have call successors, (0), 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-12 00:10:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 543 transitions. [2023-11-12 00:10:35,992 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 543 transitions. Word has length 27 [2023-11-12 00:10:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:35,993 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 543 transitions. [2023-11-12 00:10:35,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-12 00:10:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 543 transitions. [2023-11-12 00:10:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:10:35,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:35,995 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] [2023-11-12 00:10:35,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 00:10:35,995 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:35,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:35,996 INFO L85 PathProgramCache]: Analyzing trace with hash -145358821, now seen corresponding path program 2 times [2023-11-12 00:10:35,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:35,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345349238] [2023-11-12 00:10:35,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:35,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:37,371 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-12 00:10:37,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:37,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345349238] [2023-11-12 00:10:37,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345349238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:37,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:37,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:10:37,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632775052] [2023-11-12 00:10:37,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:37,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:10:37,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:37,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:10:37,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:10:37,373 INFO L87 Difference]: Start difference. First operand 214 states and 543 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-12 00:10:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:37,579 INFO L93 Difference]: Finished difference Result 300 states and 761 transitions. [2023-11-12 00:10:37,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:10:37,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2023-11-12 00:10:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:37,581 INFO L225 Difference]: With dead ends: 300 [2023-11-12 00:10:37,581 INFO L226 Difference]: Without dead ends: 250 [2023-11-12 00:10:37,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:10:37,582 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 60 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:37,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 29 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:10:37,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-11-12 00:10:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 190. [2023-11-12 00:10:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.4497354497354498) internal successors, (463), 189 states have internal predecessors, (463), 0 states have call successors, (0), 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-12 00:10:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 463 transitions. [2023-11-12 00:10:37,589 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 463 transitions. Word has length 27 [2023-11-12 00:10:37,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:37,589 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 463 transitions. [2023-11-12 00:10:37,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-12 00:10:37,590 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 463 transitions. [2023-11-12 00:10:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:10:37,590 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:37,591 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] [2023-11-12 00:10:37,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 00:10:37,591 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:37,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:37,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1599094897, now seen corresponding path program 3 times [2023-11-12 00:10:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:37,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231931735] [2023-11-12 00:10:37,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:37,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:10:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:10:38,911 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:10:38,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231931735] [2023-11-12 00:10:38,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231931735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:10:38,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:10:38,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:10:38,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870339237] [2023-11-12 00:10:38,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:10:38,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 00:10:38,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:10:38,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 00:10:38,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:10:38,914 INFO L87 Difference]: Start difference. First operand 190 states and 463 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-12 00:10:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:10:39,197 INFO L93 Difference]: Finished difference Result 252 states and 613 transitions. [2023-11-12 00:10:39,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:10:39,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2023-11-12 00:10:39,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:10:39,198 INFO L225 Difference]: With dead ends: 252 [2023-11-12 00:10:39,199 INFO L226 Difference]: Without dead ends: 192 [2023-11-12 00:10:39,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:10:39,199 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 64 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:10:39,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 24 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:10:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-12 00:10:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2023-11-12 00:10:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.4850299401197606) internal successors, (415), 167 states have internal predecessors, (415), 0 states have call successors, (0), 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-12 00:10:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 415 transitions. [2023-11-12 00:10:39,206 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 415 transitions. Word has length 27 [2023-11-12 00:10:39,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:10:39,206 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 415 transitions. [2023-11-12 00:10:39,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-12 00:10:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 415 transitions. [2023-11-12 00:10:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:10:39,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:10:39,207 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] [2023-11-12 00:10:39,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 00:10:39,208 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 00:10:39,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:10:39,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1600832027, now seen corresponding path program 4 times [2023-11-12 00:10:39,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:10:39,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097419867] [2023-11-12 00:10:39,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:10:39,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:10:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:10:39,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 00:10:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:10:39,366 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-12 00:10:39,366 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 00:10:39,367 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-12 00:10:39,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-12 00:10:39,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-12 00:10:39,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-12 00:10:39,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-12 00:10:39,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-12 00:10:39,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-12 00:10:39,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 00:10:39,373 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:10:39,379 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 00:10:39,380 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:10:39,441 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-12 00:10:39,447 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 00:10:39,448 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 00:10:39,454 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 00:10:39,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:10:39 BasicIcfg [2023-11-12 00:10:39,493 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:10:39,493 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:10:39,494 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:10:39,494 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:10:39,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:10:19" (3/4) ... [2023-11-12 00:10:39,495 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 00:10:39,539 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-12 00:10:39,543 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 00:10:39,545 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 00:10:39,552 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 00:10:39,623 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/witness.graphml [2023-11-12 00:10:39,624 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:10:39,624 INFO L158 Benchmark]: Toolchain (without parser) took 21710.03ms. Allocated memory was 136.3MB in the beginning and 323.0MB in the end (delta: 186.6MB). Free memory was 90.1MB in the beginning and 114.3MB in the end (delta: -24.2MB). Peak memory consumption was 164.5MB. Max. memory is 16.1GB. [2023-11-12 00:10:39,625 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 136.3MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:10:39,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 664.30ms. Allocated memory is still 136.3MB. Free memory was 89.7MB in the beginning and 66.1MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 00:10:39,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.68ms. Allocated memory is still 136.3MB. Free memory was 66.1MB in the beginning and 63.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:10:39,626 INFO L158 Benchmark]: Boogie Preprocessor took 66.13ms. Allocated memory is still 136.3MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:10:39,626 INFO L158 Benchmark]: RCFGBuilder took 847.09ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 61.2MB in the beginning and 121.4MB in the end (delta: -60.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2023-11-12 00:10:39,627 INFO L158 Benchmark]: TraceAbstraction took 19892.56ms. Allocated memory was 184.5MB in the beginning and 323.0MB in the end (delta: 138.4MB). Free memory was 120.3MB in the beginning and 129.0MB in the end (delta: -8.7MB). Peak memory consumption was 128.6MB. Max. memory is 16.1GB. [2023-11-12 00:10:39,627 INFO L158 Benchmark]: Witness Printer took 130.40ms. Allocated memory is still 323.0MB. Free memory was 129.0MB in the beginning and 114.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 00:10:39,629 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.27ms. Allocated memory is still 136.3MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 664.30ms. Allocated memory is still 136.3MB. Free memory was 89.7MB in the beginning and 66.1MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.68ms. Allocated memory is still 136.3MB. Free memory was 66.1MB in the beginning and 63.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.13ms. Allocated memory is still 136.3MB. Free memory was 63.3MB in the beginning and 61.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 847.09ms. Allocated memory was 136.3MB in the beginning and 184.5MB in the end (delta: 48.2MB). Free memory was 61.2MB in the beginning and 121.4MB in the end (delta: -60.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19892.56ms. Allocated memory was 184.5MB in the beginning and 323.0MB in the end (delta: 138.4MB). Free memory was 120.3MB in the beginning and 129.0MB in the end (delta: -8.7MB). Peak memory consumption was 128.6MB. Max. memory is 16.1GB. * Witness Printer took 130.40ms. Allocated memory is still 323.0MB. Free memory was 129.0MB in the beginning and 114.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8s, 143 PlacesBefore, 46 PlacesAfterwards, 132 TransitionsBefore, 34 TransitionsAfterwards, 3218 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 8732 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3741, independent: 3512, independent conditional: 0, independent unconditional: 3512, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2239, independent: 2165, independent conditional: 0, independent unconditional: 2165, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2239, independent: 2131, independent conditional: 0, independent unconditional: 2131, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 108, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 695, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 600, dependent conditional: 0, dependent unconditional: 600, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3741, independent: 1347, independent conditional: 0, independent unconditional: 1347, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 2239, unknown conditional: 0, unknown unconditional: 2239] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 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; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L753] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [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 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 168 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 407 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 933 IncrementalHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 85 mSDtfsCounter, 933 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3410occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 263 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 2068 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-12 00:10:39,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2dd88bbc-25c8-49cb-a5e2-3f0b0fe64843/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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