./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:17:09,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:17:09,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:17:09,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:17:09,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:17:09,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:17:09,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:17:09,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:17:09,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:17:09,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:17:09,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:17:09,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:17:09,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:17:09,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:17:09,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:17:09,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:17:09,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:17:09,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:17:09,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:17:09,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:17:09,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:17:09,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:17:09,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:17:09,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:17:09,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:17:09,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:17:09,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:17:09,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:17:09,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:17:09,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:17:09,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:17:09,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:17:09,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:17:09,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:17:09,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:17:09,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:17:09,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:17:09,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:17:09,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:17:09,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:17:09,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:17:09,624 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:17:09,666 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:17:09,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:17:09,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:17:09,667 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:17:09,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:17:09,668 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:17:09,669 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:17:09,669 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:17:09,669 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:17:09,670 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:17:09,671 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:17:09,671 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:17:09,671 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:17:09,672 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:17:09,672 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:17:09,672 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:17:09,672 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:17:09,673 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:17:09,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:17:09,674 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:17:09,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:17:09,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:17:09,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:17:09,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:17:09,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:17:09,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:17:09,677 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:17:09,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:17:09,678 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:17:09,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:17:09,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:17:09,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:17:09,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:17:09,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:17:09,680 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:17:09,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:17:09,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:17:09,680 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:17:09,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:17:09,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:17:09,681 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:17:09,682 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/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_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2022-11-03 02:17:09,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:17:10,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:17:10,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:17:10,025 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:17:10,026 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:17:10,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread/queue.i [2022-11-03 02:17:10,109 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/data/9a6cded6b/082dd1b413414bf49bf482fdc3186ade/FLAGa2969fa03 [2022-11-03 02:17:10,750 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:17:10,751 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/sv-benchmarks/c/pthread/queue.i [2022-11-03 02:17:10,771 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/data/9a6cded6b/082dd1b413414bf49bf482fdc3186ade/FLAGa2969fa03 [2022-11-03 02:17:11,006 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/data/9a6cded6b/082dd1b413414bf49bf482fdc3186ade [2022-11-03 02:17:11,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:17:11,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:17:11,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:17:11,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:17:11,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:17:11,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:17:11" (1/1) ... [2022-11-03 02:17:11,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ee4c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11, skipping insertion in model container [2022-11-03 02:17:11,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:17:11" (1/1) ... [2022-11-03 02:17:11,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:17:11,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:17:11,726 WARN L230 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_5a577e21-d6be-4961-aa39-5e11faf61e75/sv-benchmarks/c/pthread/queue.i[43284,43297] [2022-11-03 02:17:11,741 WARN L230 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_5a577e21-d6be-4961-aa39-5e11faf61e75/sv-benchmarks/c/pthread/queue.i[43491,43504] [2022-11-03 02:17:11,745 WARN L230 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_5a577e21-d6be-4961-aa39-5e11faf61e75/sv-benchmarks/c/pthread/queue.i[43772,43785] [2022-11-03 02:17:11,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:17:11,762 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:17:11,846 WARN L230 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_5a577e21-d6be-4961-aa39-5e11faf61e75/sv-benchmarks/c/pthread/queue.i[43284,43297] [2022-11-03 02:17:11,851 WARN L230 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_5a577e21-d6be-4961-aa39-5e11faf61e75/sv-benchmarks/c/pthread/queue.i[43491,43504] [2022-11-03 02:17:11,859 WARN L230 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_5a577e21-d6be-4961-aa39-5e11faf61e75/sv-benchmarks/c/pthread/queue.i[43772,43785] [2022-11-03 02:17:11,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:17:11,927 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:17:11,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11 WrapperNode [2022-11-03 02:17:11,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:17:11,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:17:11,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:17:11,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:17:11,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11" (1/1) ... [2022-11-03 02:17:11,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11" (1/1) ... [2022-11-03 02:17:11,990 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2022-11-03 02:17:11,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:17:11,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:17:11,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:17:11,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:17:12,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11" (1/1) ... [2022-11-03 02:17:12,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11" (1/1) ... [2022-11-03 02:17:12,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11" (1/1) ... [2022-11-03 02:17:12,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11" (1/1) ... [2022-11-03 02:17:12,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11" (1/1) ... [2022-11-03 02:17:12,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11" (1/1) ... [2022-11-03 02:17:12,061 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11" (1/1) ... [2022-11-03 02:17:12,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11" (1/1) ... [2022-11-03 02:17:12,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:17:12,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:17:12,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:17:12,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:17:12,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11" (1/1) ... [2022-11-03 02:17:12,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:17:12,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:17:12,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:17:12,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:17:12,213 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-03 02:17:12,213 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-03 02:17:12,213 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-03 02:17:12,213 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-03 02:17:12,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:17:12,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:17:12,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:17:12,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:17:12,214 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 02:17:12,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:17:12,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:17:12,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:17:12,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:17:12,217 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:17:12,423 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:17:12,425 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:17:13,145 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:17:13,161 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:17:13,163 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 02:17:13,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:17:13 BoogieIcfgContainer [2022-11-03 02:17:13,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:17:13,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:17:13,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:17:13,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:17:13,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:17:11" (1/3) ... [2022-11-03 02:17:13,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b8a31a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:17:13, skipping insertion in model container [2022-11-03 02:17:13,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:17:11" (2/3) ... [2022-11-03 02:17:13,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b8a31a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:17:13, skipping insertion in model container [2022-11-03 02:17:13,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:17:13" (3/3) ... [2022-11-03 02:17:13,179 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2022-11-03 02:17:13,193 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:17:13,207 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:17:13,207 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-03 02:17:13,207 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:17:13,422 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-03 02:17:13,497 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:17:13,518 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 266 places, 274 transitions, 564 flow [2022-11-03 02:17:13,524 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 266 places, 274 transitions, 564 flow [2022-11-03 02:17:13,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 274 transitions, 564 flow [2022-11-03 02:17:13,776 INFO L130 PetriNetUnfolder]: 15/272 cut-off events. [2022-11-03 02:17:13,780 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-03 02:17:13,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 272 events. 15/272 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 361 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 198. Up to 2 conditions per place. [2022-11-03 02:17:13,804 INFO L118 LiptonReduction]: Number of co-enabled transitions 16892 [2022-11-03 02:17:26,534 INFO L133 LiptonReduction]: Checked pairs total: 35055 [2022-11-03 02:17:26,539 INFO L135 LiptonReduction]: Total number of compositions: 241 [2022-11-03 02:17:26,550 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 69 transitions, 154 flow [2022-11-03 02:17:26,661 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1056 states, 1051 states have (on average 2.8001902949571837) internal successors, (2943), 1055 states have internal predecessors, (2943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:26,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:17:26,695 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d2db2cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:17:26,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-03 02:17:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 1056 states, 1051 states have (on average 2.8001902949571837) internal successors, (2943), 1055 states have internal predecessors, (2943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:26,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 02:17:26,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:26,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 02:17:26,707 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:17:26,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash 33588, now seen corresponding path program 1 times [2022-11-03 02:17:26,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:26,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348459634] [2022-11-03 02:17:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:26,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:26,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348459634] [2022-11-03 02:17:26,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348459634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:26,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:26,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:17:26,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602296768] [2022-11-03 02:17:26,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:26,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 02:17:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:26,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 02:17:26,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:17:26,933 INFO L87 Difference]: Start difference. First operand has 1056 states, 1051 states have (on average 2.8001902949571837) internal successors, (2943), 1055 states have internal predecessors, (2943), 0 states have call successors, (0), 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 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:27,157 INFO L93 Difference]: Finished difference Result 1054 states and 2844 transitions. [2022-11-03 02:17:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 02:17:27,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-03 02:17:27,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:27,196 INFO L225 Difference]: With dead ends: 1054 [2022-11-03 02:17:27,196 INFO L226 Difference]: Without dead ends: 1052 [2022-11-03 02:17:27,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:17:27,201 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:27,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-11-03 02:17:27,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2022-11-03 02:17:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1049 states have (on average 2.7063870352716872) internal successors, (2839), 1051 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 2839 transitions. [2022-11-03 02:17:27,353 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 2839 transitions. Word has length 2 [2022-11-03 02:17:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:27,354 INFO L495 AbstractCegarLoop]: Abstraction has 1052 states and 2839 transitions. [2022-11-03 02:17:27,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 2839 transitions. [2022-11-03 02:17:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:17:27,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:27,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:27,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:17:27,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:17:27,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:27,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1922295768, now seen corresponding path program 1 times [2022-11-03 02:17:27,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:27,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580892424] [2022-11-03 02:17:27,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:27,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:27,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:27,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580892424] [2022-11-03 02:17:27,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580892424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:27,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:27,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:17:27,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616976886] [2022-11-03 02:17:27,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:27,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:17:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:27,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:17:27,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:27,560 INFO L87 Difference]: Start difference. First operand 1052 states and 2839 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2022-11-03 02:17:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:27,730 INFO L93 Difference]: Finished difference Result 1052 states and 2805 transitions. [2022-11-03 02:17:27,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:17:27,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 [2022-11-03 02:17:27,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:27,738 INFO L225 Difference]: With dead ends: 1052 [2022-11-03 02:17:27,738 INFO L226 Difference]: Without dead ends: 1052 [2022-11-03 02:17:27,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:27,740 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:27,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 13 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-11-03 02:17:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2022-11-03 02:17:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1049 states have (on average 2.6739752144899906) internal successors, (2805), 1051 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 2805 transitions. [2022-11-03 02:17:27,784 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 2805 transitions. Word has length 11 [2022-11-03 02:17:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:27,784 INFO L495 AbstractCegarLoop]: Abstraction has 1052 states and 2805 transitions. [2022-11-03 02:17:27,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2022-11-03 02:17:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 2805 transitions. [2022-11-03 02:17:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:17:27,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:27,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:27,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:17:27,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:17:27,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:27,788 INFO L85 PathProgramCache]: Analyzing trace with hash 491386287, now seen corresponding path program 1 times [2022-11-03 02:17:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:27,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603864088] [2022-11-03 02:17:27,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:27,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:29,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:29,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603864088] [2022-11-03 02:17:29,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603864088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:29,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:29,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:17:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050124623] [2022-11-03 02:17:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:29,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:17:29,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:29,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:17:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:29,132 INFO L87 Difference]: Start difference. First operand 1052 states and 2805 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:29,673 INFO L93 Difference]: Finished difference Result 1051 states and 2802 transitions. [2022-11-03 02:17:29,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:29,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:17:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:29,680 INFO L225 Difference]: With dead ends: 1051 [2022-11-03 02:17:29,681 INFO L226 Difference]: Without dead ends: 1051 [2022-11-03 02:17:29,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:17:29,686 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:29,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 16 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:17:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2022-11-03 02:17:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2022-11-03 02:17:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1048 states have (on average 2.6736641221374047) internal successors, (2802), 1050 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 2802 transitions. [2022-11-03 02:17:29,745 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 2802 transitions. Word has length 13 [2022-11-03 02:17:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:29,749 INFO L495 AbstractCegarLoop]: Abstraction has 1051 states and 2802 transitions. [2022-11-03 02:17:29,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 2802 transitions. [2022-11-03 02:17:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:17:29,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:29,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:29,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:17:29,755 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:17:29,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:29,756 INFO L85 PathProgramCache]: Analyzing trace with hash -476694036, now seen corresponding path program 1 times [2022-11-03 02:17:29,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:29,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783362757] [2022-11-03 02:17:29,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:29,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:31,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:31,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783362757] [2022-11-03 02:17:31,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783362757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:31,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:31,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:17:31,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019828897] [2022-11-03 02:17:31,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:31,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:17:31,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:31,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:17:31,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:31,030 INFO L87 Difference]: Start difference. First operand 1051 states and 2802 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:31,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:31,650 INFO L93 Difference]: Finished difference Result 1055 states and 2811 transitions. [2022-11-03 02:17:31,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:31,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 02:17:31,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:31,657 INFO L225 Difference]: With dead ends: 1055 [2022-11-03 02:17:31,657 INFO L226 Difference]: Without dead ends: 1055 [2022-11-03 02:17:31,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:17:31,662 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:31,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 35 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:17:31,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-11-03 02:17:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1049. [2022-11-03 02:17:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 1046 states have (on average 2.6749521988527722) internal successors, (2798), 1048 states have internal predecessors, (2798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 2798 transitions. [2022-11-03 02:17:31,701 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 2798 transitions. Word has length 14 [2022-11-03 02:17:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:31,702 INFO L495 AbstractCegarLoop]: Abstraction has 1049 states and 2798 transitions. [2022-11-03 02:17:31,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 2798 transitions. [2022-11-03 02:17:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:17:31,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:31,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:31,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:17:31,710 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:17:31,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:31,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1799216173, now seen corresponding path program 1 times [2022-11-03 02:17:31,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:31,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204437342] [2022-11-03 02:17:31,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:31,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:32,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:32,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204437342] [2022-11-03 02:17:32,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204437342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:32,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:32,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:32,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297141158] [2022-11-03 02:17:32,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:32,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:17:32,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:32,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:17:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:17:32,802 INFO L87 Difference]: Start difference. First operand 1049 states and 2798 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:33,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:33,868 INFO L93 Difference]: Finished difference Result 1537 states and 4100 transitions. [2022-11-03 02:17:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:33,869 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 02:17:33,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:33,878 INFO L225 Difference]: With dead ends: 1537 [2022-11-03 02:17:33,879 INFO L226 Difference]: Without dead ends: 1529 [2022-11-03 02:17:33,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:17:33,880 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 120 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:33,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 47 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 02:17:33,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2022-11-03 02:17:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1190. [2022-11-03 02:17:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1187 states have (on average 2.6798652064026958) internal successors, (3181), 1189 states have internal predecessors, (3181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 3181 transitions. [2022-11-03 02:17:33,930 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 3181 transitions. Word has length 14 [2022-11-03 02:17:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:33,930 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 3181 transitions. [2022-11-03 02:17:33,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 3181 transitions. [2022-11-03 02:17:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:17:33,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:33,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:33,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:17:33,933 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:17:33,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:33,934 INFO L85 PathProgramCache]: Analyzing trace with hash 494180274, now seen corresponding path program 1 times [2022-11-03 02:17:33,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:33,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257693930] [2022-11-03 02:17:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:33,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:34,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:34,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257693930] [2022-11-03 02:17:34,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257693930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:34,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:34,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:17:34,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486113514] [2022-11-03 02:17:34,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:34,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:17:34,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:34,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:17:34,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:34,011 INFO L87 Difference]: Start difference. First operand 1190 states and 3181 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:34,133 INFO L93 Difference]: Finished difference Result 946 states and 2458 transitions. [2022-11-03 02:17:34,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:17:34,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 02:17:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:34,139 INFO L225 Difference]: With dead ends: 946 [2022-11-03 02:17:34,139 INFO L226 Difference]: Without dead ends: 924 [2022-11-03 02:17:34,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:34,140 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 40 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:34,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 10 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2022-11-03 02:17:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2022-11-03 02:17:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 921 states have (on average 2.6112920738327903) internal successors, (2405), 923 states have internal predecessors, (2405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 2405 transitions. [2022-11-03 02:17:34,174 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 2405 transitions. Word has length 14 [2022-11-03 02:17:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:34,175 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 2405 transitions. [2022-11-03 02:17:34,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 2405 transitions. [2022-11-03 02:17:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:17:34,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:34,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:34,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:17:34,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:17:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:34,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1892620202, now seen corresponding path program 1 times [2022-11-03 02:17:34,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:34,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517691] [2022-11-03 02:17:34,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:34,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:35,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:35,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517691] [2022-11-03 02:17:35,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:35,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:35,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:17:35,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751679910] [2022-11-03 02:17:35,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:35,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:17:35,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:35,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:17:35,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:17:35,372 INFO L87 Difference]: Start difference. First operand 924 states and 2405 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:36,100 INFO L93 Difference]: Finished difference Result 896 states and 2335 transitions. [2022-11-03 02:17:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:17:36,101 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 02:17:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:36,106 INFO L225 Difference]: With dead ends: 896 [2022-11-03 02:17:36,107 INFO L226 Difference]: Without dead ends: 874 [2022-11-03 02:17:36,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:17:36,108 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 68 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:36,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 32 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:17:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2022-11-03 02:17:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 844. [2022-11-03 02:17:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 2.6109134045077105) internal successors, (2201), 843 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 2201 transitions. [2022-11-03 02:17:36,141 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 2201 transitions. Word has length 15 [2022-11-03 02:17:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:36,142 INFO L495 AbstractCegarLoop]: Abstraction has 844 states and 2201 transitions. [2022-11-03 02:17:36,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 2201 transitions. [2022-11-03 02:17:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:17:36,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:36,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:36,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:17:36,149 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:17:36,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:36,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2012051313, now seen corresponding path program 1 times [2022-11-03 02:17:36,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:36,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148028677] [2022-11-03 02:17:36,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:36,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:36,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:36,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148028677] [2022-11-03 02:17:36,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148028677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:36,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:36,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:17:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556113199] [2022-11-03 02:17:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:36,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:17:36,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:36,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:17:36,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:36,301 INFO L87 Difference]: Start difference. First operand 844 states and 2201 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:36,407 INFO L93 Difference]: Finished difference Result 376 states and 808 transitions. [2022-11-03 02:17:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:17:36,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-03 02:17:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:36,411 INFO L225 Difference]: With dead ends: 376 [2022-11-03 02:17:36,411 INFO L226 Difference]: Without dead ends: 370 [2022-11-03 02:17:36,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:36,413 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:36,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-03 02:17:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 298. [2022-11-03 02:17:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 2.1784511784511786) internal successors, (647), 297 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 647 transitions. [2022-11-03 02:17:36,425 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 647 transitions. Word has length 36 [2022-11-03 02:17:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:36,426 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 647 transitions. [2022-11-03 02:17:36,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 647 transitions. [2022-11-03 02:17:36,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 02:17:36,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:36,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:36,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:17:36,428 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:17:36,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:36,429 INFO L85 PathProgramCache]: Analyzing trace with hash -92884690, now seen corresponding path program 1 times [2022-11-03 02:17:36,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:36,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206219320] [2022-11-03 02:17:36,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:36,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:38,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:38,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206219320] [2022-11-03 02:17:38,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206219320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:38,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:38,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 02:17:38,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656175794] [2022-11-03 02:17:38,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:38,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:17:38,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:38,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:17:38,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:17:38,029 INFO L87 Difference]: Start difference. First operand 298 states and 647 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:38,748 INFO L93 Difference]: Finished difference Result 387 states and 834 transitions. [2022-11-03 02:17:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:17:38,749 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-11-03 02:17:38,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:38,752 INFO L225 Difference]: With dead ends: 387 [2022-11-03 02:17:38,752 INFO L226 Difference]: Without dead ends: 387 [2022-11-03 02:17:38,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:17:38,753 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 73 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:38,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 32 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:17:38,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-11-03 02:17:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 372. [2022-11-03 02:17:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 2.1671159029649596) internal successors, (804), 371 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 804 transitions. [2022-11-03 02:17:38,768 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 804 transitions. Word has length 37 [2022-11-03 02:17:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:38,768 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 804 transitions. [2022-11-03 02:17:38,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 804 transitions. [2022-11-03 02:17:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 02:17:38,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:38,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:38,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:17:38,771 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:17:38,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:38,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1649943906, now seen corresponding path program 2 times [2022-11-03 02:17:38,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:38,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738075194] [2022-11-03 02:17:38,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:38,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:40,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:40,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738075194] [2022-11-03 02:17:40,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738075194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:40,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:40,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 02:17:40,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639576234] [2022-11-03 02:17:40,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:40,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:17:40,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:40,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:17:40,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:17:40,546 INFO L87 Difference]: Start difference. First operand 372 states and 804 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:41,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:41,218 INFO L93 Difference]: Finished difference Result 434 states and 931 transitions. [2022-11-03 02:17:41,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:17:41,219 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-11-03 02:17:41,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:41,222 INFO L225 Difference]: With dead ends: 434 [2022-11-03 02:17:41,222 INFO L226 Difference]: Without dead ends: 434 [2022-11-03 02:17:41,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:17:41,224 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 94 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:41,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 36 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:17:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-11-03 02:17:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 338. [2022-11-03 02:17:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.166172106824926) internal successors, (730), 337 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 730 transitions. [2022-11-03 02:17:41,238 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 730 transitions. Word has length 37 [2022-11-03 02:17:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:41,239 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 730 transitions. [2022-11-03 02:17:41,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 730 transitions. [2022-11-03 02:17:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 02:17:41,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:41,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:41,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:17:41,242 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:17:41,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1239386283, now seen corresponding path program 1 times [2022-11-03 02:17:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:41,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962024149] [2022-11-03 02:17:41,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:41,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:43,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:43,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962024149] [2022-11-03 02:17:43,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962024149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:43,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:43,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-03 02:17:43,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057364583] [2022-11-03 02:17:43,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:43,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 02:17:43,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:43,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 02:17:43,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:17:43,976 INFO L87 Difference]: Start difference. First operand 338 states and 730 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:45,093 INFO L93 Difference]: Finished difference Result 472 states and 1026 transitions. [2022-11-03 02:17:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:17:45,093 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-03 02:17:45,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:45,096 INFO L225 Difference]: With dead ends: 472 [2022-11-03 02:17:45,096 INFO L226 Difference]: Without dead ends: 472 [2022-11-03 02:17:45,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-03 02:17:45,097 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 158 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:45,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 35 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:17:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-11-03 02:17:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 444. [2022-11-03 02:17:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 2.18510158013544) internal successors, (968), 443 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 968 transitions. [2022-11-03 02:17:45,112 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 968 transitions. Word has length 38 [2022-11-03 02:17:45,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:45,113 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 968 transitions. [2022-11-03 02:17:45,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 968 transitions. [2022-11-03 02:17:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 02:17:45,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:45,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:45,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:17:45,117 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:17:45,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash -236246228, now seen corresponding path program 1 times [2022-11-03 02:17:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:45,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819711682] [2022-11-03 02:17:45,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:49,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:49,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819711682] [2022-11-03 02:17:49,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819711682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:49,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:49,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-03 02:17:49,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857690075] [2022-11-03 02:17:49,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:49,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 02:17:49,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:49,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 02:17:49,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-11-03 02:17:49,806 INFO L87 Difference]: Start difference. First operand 444 states and 968 transitions. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:55,423 INFO L93 Difference]: Finished difference Result 800 states and 1739 transitions. [2022-11-03 02:17:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-03 02:17:55,424 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-11-03 02:17:55,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:55,428 INFO L225 Difference]: With dead ends: 800 [2022-11-03 02:17:55,428 INFO L226 Difference]: Without dead ends: 764 [2022-11-03 02:17:55,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=393, Invalid=2577, Unknown=0, NotChecked=0, Total=2970 [2022-11-03 02:17:55,430 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 300 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:55,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 132 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2033 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-03 02:17:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-11-03 02:17:55,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 580. [2022-11-03 02:17:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 2.1778929188255614) internal successors, (1261), 579 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1261 transitions. [2022-11-03 02:17:55,450 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1261 transitions. Word has length 39 [2022-11-03 02:17:55,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:55,451 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 1261 transitions. [2022-11-03 02:17:55,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1261 transitions. [2022-11-03 02:17:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 02:17:55,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:55,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:55,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:17:55,454 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:17:55,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:55,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1383463016, now seen corresponding path program 2 times [2022-11-03 02:17:55,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:55,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767300292] [2022-11-03 02:17:55,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:55,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:00,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:00,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767300292] [2022-11-03 02:18:00,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767300292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:00,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:00,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-11-03 02:18:00,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160863256] [2022-11-03 02:18:00,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:00,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 02:18:00,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:00,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 02:18:00,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:18:00,799 INFO L87 Difference]: Start difference. First operand 580 states and 1261 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:04,635 INFO L93 Difference]: Finished difference Result 766 states and 1651 transitions. [2022-11-03 02:18:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 02:18:04,635 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-11-03 02:18:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:04,639 INFO L225 Difference]: With dead ends: 766 [2022-11-03 02:18:04,639 INFO L226 Difference]: Without dead ends: 730 [2022-11-03 02:18:04,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 02:18:04,641 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 162 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 2106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:04,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 147 Invalid, 2106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2061 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-03 02:18:04,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2022-11-03 02:18:04,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 582. [2022-11-03 02:18:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 2.1755593803786577) internal successors, (1264), 581 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1264 transitions. [2022-11-03 02:18:04,662 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1264 transitions. Word has length 39 [2022-11-03 02:18:04,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:04,662 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 1264 transitions. [2022-11-03 02:18:04,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1264 transitions. [2022-11-03 02:18:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 02:18:04,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:04,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:04,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:18:04,665 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:18:04,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:04,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1144344684, now seen corresponding path program 3 times [2022-11-03 02:18:04,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:04,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838330546] [2022-11-03 02:18:04,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:04,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:09,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:09,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838330546] [2022-11-03 02:18:09,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838330546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:09,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:09,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-03 02:18:09,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954607751] [2022-11-03 02:18:09,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:09,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 02:18:09,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:09,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 02:18:09,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-11-03 02:18:09,375 INFO L87 Difference]: Start difference. First operand 582 states and 1264 transitions. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:12,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:12,940 INFO L93 Difference]: Finished difference Result 758 states and 1631 transitions. [2022-11-03 02:18:12,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 02:18:12,943 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-11-03 02:18:12,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:12,947 INFO L225 Difference]: With dead ends: 758 [2022-11-03 02:18:12,948 INFO L226 Difference]: Without dead ends: 722 [2022-11-03 02:18:12,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2022-11-03 02:18:12,949 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 148 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:12,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 152 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-03 02:18:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-11-03 02:18:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 584. [2022-11-03 02:18:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 583 states have (on average 2.1732418524871355) internal successors, (1267), 583 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1267 transitions. [2022-11-03 02:18:12,967 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1267 transitions. Word has length 39 [2022-11-03 02:18:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:12,968 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 1267 transitions. [2022-11-03 02:18:12,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1267 transitions. [2022-11-03 02:18:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 02:18:12,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:12,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:12,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:18:12,970 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:18:12,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:12,971 INFO L85 PathProgramCache]: Analyzing trace with hash -406604298, now seen corresponding path program 4 times [2022-11-03 02:18:12,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:12,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466668289] [2022-11-03 02:18:12,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:12,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:16,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:16,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:16,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466668289] [2022-11-03 02:18:16,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466668289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:16,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:16,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-03 02:18:16,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062641237] [2022-11-03 02:18:16,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:16,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 02:18:16,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:16,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 02:18:16,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-11-03 02:18:16,727 INFO L87 Difference]: Start difference. First operand 584 states and 1267 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:20,068 INFO L93 Difference]: Finished difference Result 760 states and 1630 transitions. [2022-11-03 02:18:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 02:18:20,068 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-11-03 02:18:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:20,072 INFO L225 Difference]: With dead ends: 760 [2022-11-03 02:18:20,072 INFO L226 Difference]: Without dead ends: 724 [2022-11-03 02:18:20,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=212, Invalid=1594, Unknown=0, NotChecked=0, Total=1806 [2022-11-03 02:18:20,073 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 158 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 2046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:20,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 127 Invalid, 2046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2001 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-03 02:18:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-11-03 02:18:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 592. [2022-11-03 02:18:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 2.1641285956006766) internal successors, (1279), 591 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1279 transitions. [2022-11-03 02:18:20,092 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1279 transitions. Word has length 39 [2022-11-03 02:18:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:20,092 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 1279 transitions. [2022-11-03 02:18:20,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1279 transitions. [2022-11-03 02:18:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 02:18:20,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:20,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:20,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 02:18:20,095 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:18:20,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:20,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2063923676, now seen corresponding path program 5 times [2022-11-03 02:18:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:20,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116709196] [2022-11-03 02:18:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:20,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:25,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:25,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116709196] [2022-11-03 02:18:25,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116709196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:25,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:25,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-03 02:18:25,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276481379] [2022-11-03 02:18:25,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:25,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 02:18:25,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:25,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 02:18:25,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2022-11-03 02:18:25,053 INFO L87 Difference]: Start difference. First operand 592 states and 1279 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:29,574 INFO L93 Difference]: Finished difference Result 770 states and 1645 transitions. [2022-11-03 02:18:29,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 02:18:29,575 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-11-03 02:18:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:29,577 INFO L225 Difference]: With dead ends: 770 [2022-11-03 02:18:29,577 INFO L226 Difference]: Without dead ends: 734 [2022-11-03 02:18:29,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2022-11-03 02:18:29,579 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 167 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:29,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 135 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-03 02:18:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-11-03 02:18:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 594. [2022-11-03 02:18:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 2.1618887015177064) internal successors, (1282), 593 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 1282 transitions. [2022-11-03 02:18:29,602 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 1282 transitions. Word has length 39 [2022-11-03 02:18:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:29,603 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 1282 transitions. [2022-11-03 02:18:29,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 1282 transitions. [2022-11-03 02:18:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 02:18:29,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:29,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:29,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 02:18:29,605 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:18:29,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash -767911594, now seen corresponding path program 6 times [2022-11-03 02:18:29,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:29,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034404333] [2022-11-03 02:18:29,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:29,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:33,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:33,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034404333] [2022-11-03 02:18:33,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034404333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:33,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:33,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-03 02:18:33,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326438086] [2022-11-03 02:18:33,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:33,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 02:18:33,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:33,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 02:18:33,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-11-03 02:18:33,153 INFO L87 Difference]: Start difference. First operand 594 states and 1282 transitions. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:36,441 INFO L93 Difference]: Finished difference Result 774 states and 1651 transitions. [2022-11-03 02:18:36,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 02:18:36,442 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-11-03 02:18:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:36,445 INFO L225 Difference]: With dead ends: 774 [2022-11-03 02:18:36,446 INFO L226 Difference]: Without dead ends: 738 [2022-11-03 02:18:36,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 02:18:36,448 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 138 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:36,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 148 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2306 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 02:18:36,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-11-03 02:18:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 596. [2022-11-03 02:18:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 2.1596638655462184) internal successors, (1285), 595 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1285 transitions. [2022-11-03 02:18:36,466 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1285 transitions. Word has length 39 [2022-11-03 02:18:36,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:36,466 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 1285 transitions. [2022-11-03 02:18:36,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1285 transitions. [2022-11-03 02:18:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 02:18:36,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:36,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:36,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 02:18:36,469 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:18:36,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:36,470 INFO L85 PathProgramCache]: Analyzing trace with hash 590830398, now seen corresponding path program 7 times [2022-11-03 02:18:36,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:36,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303454940] [2022-11-03 02:18:36,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:36,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:39,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:39,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303454940] [2022-11-03 02:18:39,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303454940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:39,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:39,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-11-03 02:18:39,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819123953] [2022-11-03 02:18:39,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:39,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 02:18:39,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:39,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 02:18:39,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:18:39,988 INFO L87 Difference]: Start difference. First operand 596 states and 1285 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:43,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:43,009 INFO L93 Difference]: Finished difference Result 788 states and 1678 transitions. [2022-11-03 02:18:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 02:18:43,009 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-11-03 02:18:43,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:43,012 INFO L225 Difference]: With dead ends: 788 [2022-11-03 02:18:43,012 INFO L226 Difference]: Without dead ends: 752 [2022-11-03 02:18:43,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=194, Invalid=1366, Unknown=0, NotChecked=0, Total=1560 [2022-11-03 02:18:43,013 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 159 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:43,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 139 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1835 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-03 02:18:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-11-03 02:18:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 598. [2022-11-03 02:18:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 2.1608040201005023) internal successors, (1290), 597 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1290 transitions. [2022-11-03 02:18:43,030 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1290 transitions. Word has length 39 [2022-11-03 02:18:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:43,030 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 1290 transitions. [2022-11-03 02:18:43,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1290 transitions. [2022-11-03 02:18:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 02:18:43,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:43,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:43,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 02:18:43,033 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:18:43,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:43,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1037518574, now seen corresponding path program 1 times [2022-11-03 02:18:43,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:43,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195316184] [2022-11-03 02:18:43,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:43,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:43,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:43,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195316184] [2022-11-03 02:18:43,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195316184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:43,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:43,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:18:43,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249283975] [2022-11-03 02:18:43,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:43,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:18:43,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:43,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:18:43,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:18:43,091 INFO L87 Difference]: Start difference. First operand 598 states and 1290 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:43,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:43,203 INFO L93 Difference]: Finished difference Result 658 states and 1410 transitions. [2022-11-03 02:18:43,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:18:43,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-11-03 02:18:43,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:43,206 INFO L225 Difference]: With dead ends: 658 [2022-11-03 02:18:43,206 INFO L226 Difference]: Without dead ends: 616 [2022-11-03 02:18:43,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:18:43,207 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:43,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 8 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:18:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-11-03 02:18:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 572. [2022-11-03 02:18:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 2.147110332749562) internal successors, (1226), 571 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1226 transitions. [2022-11-03 02:18:43,221 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1226 transitions. Word has length 41 [2022-11-03 02:18:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:43,222 INFO L495 AbstractCegarLoop]: Abstraction has 572 states and 1226 transitions. [2022-11-03 02:18:43,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1226 transitions. [2022-11-03 02:18:43,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 02:18:43,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:43,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:43,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 02:18:43,224 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:18:43,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1470479086, now seen corresponding path program 2 times [2022-11-03 02:18:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:43,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564360329] [2022-11-03 02:18:43,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:43,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:18:43,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:18:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:18:43,427 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:18:43,427 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:18:43,428 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-03 02:18:43,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-03 02:18:43,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-03 02:18:43,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-03 02:18:43,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-11-03 02:18:43,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-11-03 02:18:43,436 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-03 02:18:43,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 02:18:43,439 INFO L444 BasicCegarLoop]: Path program histogram: [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:43,447 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-03 02:18:43,447 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:18:43,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:18:43 BasicIcfg [2022-11-03 02:18:43,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:18:43,586 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:18:43,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:18:43,587 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:18:43,587 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:17:13" (3/4) ... [2022-11-03 02:18:43,590 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 02:18:43,728 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:18:43,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:18:43,729 INFO L158 Benchmark]: Toolchain (without parser) took 92718.65ms. Allocated memory was 92.3MB in the beginning and 559.9MB in the end (delta: 467.7MB). Free memory was 56.2MB in the beginning and 328.6MB in the end (delta: -272.4MB). Peak memory consumption was 195.8MB. Max. memory is 16.1GB. [2022-11-03 02:18:43,730 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 92.3MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:18:43,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 916.18ms. Allocated memory is still 92.3MB. Free memory was 56.0MB in the beginning and 48.3MB in the end (delta: 7.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:18:43,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.50ms. Allocated memory is still 92.3MB. Free memory was 48.3MB in the beginning and 45.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:18:43,736 INFO L158 Benchmark]: Boogie Preprocessor took 97.47ms. Allocated memory is still 92.3MB. Free memory was 45.3MB in the beginning and 42.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:18:43,737 INFO L158 Benchmark]: RCFGBuilder took 1074.64ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 42.9MB in the beginning and 77.9MB in the end (delta: -35.1MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2022-11-03 02:18:43,737 INFO L158 Benchmark]: TraceAbstraction took 90415.46ms. Allocated memory was 119.5MB in the beginning and 559.9MB in the end (delta: 440.4MB). Free memory was 77.2MB in the beginning and 351.6MB in the end (delta: -274.5MB). Peak memory consumption was 165.5MB. Max. memory is 16.1GB. [2022-11-03 02:18:43,738 INFO L158 Benchmark]: Witness Printer took 141.87ms. Allocated memory is still 559.9MB. Free memory was 351.6MB in the beginning and 328.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-03 02:18:43,743 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 92.3MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 916.18ms. Allocated memory is still 92.3MB. Free memory was 56.0MB in the beginning and 48.3MB in the end (delta: 7.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.50ms. Allocated memory is still 92.3MB. Free memory was 48.3MB in the beginning and 45.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.47ms. Allocated memory is still 92.3MB. Free memory was 45.3MB in the beginning and 42.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1074.64ms. Allocated memory was 92.3MB in the beginning and 119.5MB in the end (delta: 27.3MB). Free memory was 42.9MB in the beginning and 77.9MB in the end (delta: -35.1MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * TraceAbstraction took 90415.46ms. Allocated memory was 119.5MB in the beginning and 559.9MB in the end (delta: 440.4MB). Free memory was 77.2MB in the beginning and 351.6MB in the end (delta: -274.5MB). Peak memory consumption was 165.5MB. Max. memory is 16.1GB. * Witness Printer took 141.87ms. Allocated memory is still 559.9MB. Free memory was 351.6MB in the beginning and 328.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.0s, 266 PlacesBefore, 65 PlacesAfterwards, 274 TransitionsBefore, 69 TransitionsAfterwards, 16892 CoEnabledTransitionPairs, 8 FixpointIterations, 79 TrivialSequentialCompositions, 128 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 27 ConcurrentYvCompositions, 4 ChoiceCompositions, 241 TotalNumberOfCompositions, 35055 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16863, positive: 16195, positive conditional: 0, positive unconditional: 16195, negative: 668, negative conditional: 0, negative unconditional: 668, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11111, positive: 10954, positive conditional: 0, positive unconditional: 10954, negative: 157, negative conditional: 0, negative unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11111, positive: 10913, positive conditional: 0, positive unconditional: 10913, negative: 198, negative conditional: 0, negative unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 198, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 157, negative conditional: 0, negative unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 493, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 427, negative conditional: 0, negative unconditional: 427, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16863, positive: 5241, positive conditional: 0, positive unconditional: 5241, negative: 511, negative conditional: 0, negative unconditional: 511, unknown: 11111, unknown conditional: 0, unknown unconditional: 11111] , Statistics on independence cache: Total cache size (in pairs): 657, Positive cache size: 574, Positive conditional cache size: 0, Positive unconditional cache size: 574, Negative cache size: 83, Negative conditional cache size: 0, Negative unconditional cache size: 83 - 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: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(20)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1063] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={10:0}, id2={9:0}, m={5:0}, pthread_create(&id1, ((void *)0), t1, &queue)=-2, queue={7:0}, stored_elements={6:0}] [L1007] 1 int value, i; [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=11, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={7:0}, q={7:0}, q->tail=0, queue={7:0}, stored_elements={6:0}, x=11] [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L982] EXPR 1 q->tail VAL [\old(x)=11, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={7:0}, q={7:0}, q->tail=0, queue={7:0}, stored_elements={6:0}, x=11] [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail VAL [\old(x)=11, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={7:0}, q={7:0}, q->tail=0, queue={7:0}, stored_elements={6:0}, x=11] [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={7:0}, q={7:0}, q={7:0}, q={7:0}, q->head=0, queue={7:0}, stored_elements={6:0}] [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) [L1018] 1 i=0 VAL [arg={7:0}, arg={7:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={7:0}, stored_elements={6:0}, value=11] [L1064] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={10:0}, id2={9:0}, m={5:0}, pthread_create(&id2, ((void *)0), t2, &queue)=-1, queue={7:0}, stored_elements={6:0}] [L1036] 2 int i; [L1037] 2 i=0 VAL [arg={7:0}, arg={7:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={7:0}, stored_elements={6:0}] [L1037] COND TRUE 2 i<(20) [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [arg={7:0}, arg={7:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={7:0}, stored_elements={6:0}] [L1037] 2 i++ VAL [arg={7:0}, arg={7:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={7:0}, stored_elements={6:0}] [L1018] COND TRUE 1 i<((20)-1) [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={7:0}, q={7:0}, q->tail=1, queue={7:0}, stored_elements={6:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={7:0}, q={7:0}, q->tail=1, queue={7:0}, stored_elements={6:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={7:0}, q={7:0}, q->amount=1, queue={7:0}, stored_elements={6:0}, x=0] [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={7:0}, q={7:0}, q->tail=1, queue={7:0}, stored_elements={6:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={7:0}, q={7:0}, q->tail=1, queue={7:0}, stored_elements={6:0}, x=0] [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={7:0}, arg={7:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={7:0}, stored_elements={6:0}, value=0] [L1026] 1 enqueue_flag=(0) VAL [arg={7:0}, arg={7:0}, dequeue_flag=0, enqueue_flag=0, i=0, m={5:0}, queue={7:0}, stored_elements={6:0}, value=0] [L1027] 1 dequeue_flag=(1) VAL [arg={7:0}, arg={7:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={5:0}, queue={7:0}, stored_elements={6:0}, value=0] [L1037] COND TRUE 2 i<(20) [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={7:0}, q={7:0}, q->head=0, queue={7:0}, stored_elements={6:0}] [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (20)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={7:0}, arg={7:0}, dequeue(&queue)=11, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={7:0}, stored_elements={6:0}, stored_elements[i]=0] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [arg={7:0}, arg={7:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={7:0}, stored_elements={6:0}] - UnprovableResult [Line: 1059]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 429 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 90.0s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 33.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1903 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1903 mSDsluCounter, 1254 SdHoareTripleChecker+Invalid, 17.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4688 mSDsCounter, 506 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18620 IncrementalHoareTripleChecker+Invalid, 19126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 506 mSolverCounterUnsat, 128 mSDtfsCounter, 18620 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 449 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2595 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1190occurred in iteration=5, InterpolantAutomatonStates: 292, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 1668 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 41.0s InterpolantComputationTime, 586 NumberOfCodeBlocks, 586 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 526 ConstructedInterpolants, 0 QuantifiedInterpolants, 18131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 02:18:43,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a577e21-d6be-4961-aa39-5e11faf61e75/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE