./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/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_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/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_5072ea18-39d2-4014-8e3d-493b048daf67/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 f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc --- 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:21:14,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:21:14,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:21:14,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:21:14,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:21:14,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:21:14,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:21:14,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:21:14,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:21:14,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:21:14,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:21:14,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:21:14,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:21:14,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:21:14,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:21:14,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:21:14,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:21:14,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:21:14,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:21:14,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:21:14,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:21:14,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:21:14,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:21:14,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:21:14,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:21:14,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:21:14,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:21:14,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:21:14,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:21:14,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:21:14,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:21:14,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:21:14,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:21:14,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:21:14,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:21:14,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:21:14,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:21:14,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:21:14,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:21:14,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:21:14,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:21:14,769 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:21:14,814 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:21:14,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:21:14,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:21:14,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:21:14,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:21:14,817 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:21:14,817 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:21:14,817 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:21:14,817 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:21:14,818 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:21:14,819 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:21:14,819 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:21:14,819 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:21:14,819 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:21:14,820 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:21:14,820 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:21:14,820 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:21:14,820 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:21:14,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:21:14,821 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:21:14,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:21:14,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:21:14,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:21:14,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:21:14,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:21:14,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:21:14,824 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:21:14,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:21:14,824 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:21:14,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:21:14,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:21:14,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:21:14,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:21:14,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:21:14,826 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:21:14,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:21:14,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:21:14,827 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:21:14,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:21:14,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:21:14,828 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:21:14,828 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_5072ea18-39d2-4014-8e3d-493b048daf67/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_5072ea18-39d2-4014-8e3d-493b048daf67/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 -> f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc [2022-11-03 02:21:15,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:21:15,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:21:15,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:21:15,193 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:21:15,194 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:21:15,196 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2022-11-03 02:21:15,288 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/data/62b166e4f/05a9d141f7ff4b6dafe29853ba70916c/FLAGe9c855b7e [2022-11-03 02:21:15,861 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:21:15,862 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2022-11-03 02:21:15,876 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/data/62b166e4f/05a9d141f7ff4b6dafe29853ba70916c/FLAGe9c855b7e [2022-11-03 02:21:16,161 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/data/62b166e4f/05a9d141f7ff4b6dafe29853ba70916c [2022-11-03 02:21:16,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:21:16,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:21:16,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:21:16,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:21:16,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:21:16,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:21:16" (1/1) ... [2022-11-03 02:21:16,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37028b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:16, skipping insertion in model container [2022-11-03 02:21:16,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:21:16" (1/1) ... [2022-11-03 02:21:16,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:21:16,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:21:16,534 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_5072ea18-39d2-4014-8e3d-493b048daf67/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2022-11-03 02:21:16,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:21:16,554 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:21:16,586 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_5072ea18-39d2-4014-8e3d-493b048daf67/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2022-11-03 02:21:16,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:21:16,607 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:21:16,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:16 WrapperNode [2022-11-03 02:21:16,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:21:16,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:21:16,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:21:16,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:21:16,618 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:21:16" (1/1) ... [2022-11-03 02:21:16,629 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:21:16" (1/1) ... [2022-11-03 02:21:16,664 INFO L138 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 346 [2022-11-03 02:21:16,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:21:16,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:21:16,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:21:16,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:21:16,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:16" (1/1) ... [2022-11-03 02:21:16,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:16" (1/1) ... [2022-11-03 02:21:16,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:16" (1/1) ... [2022-11-03 02:21:16,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:16" (1/1) ... [2022-11-03 02:21:16,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:16" (1/1) ... [2022-11-03 02:21:16,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:16" (1/1) ... [2022-11-03 02:21:16,699 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:16" (1/1) ... [2022-11-03 02:21:16,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:16" (1/1) ... [2022-11-03 02:21:16,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:21:16,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:21:16,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:21:16,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:21:16,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:16" (1/1) ... [2022-11-03 02:21:16,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:21:16,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:21:16,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:21:16,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:21:16,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:21:16,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:21:16,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:21:16,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:21:16,814 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 02:21:16,814 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 02:21:16,814 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 02:21:16,814 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 02:21:16,815 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 02:21:16,815 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 02:21:16,815 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-03 02:21:16,815 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-03 02:21:16,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:21:16,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 02:21:16,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 02:21:16,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:21:16,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:21:16,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:21:16,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:21:16,818 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:21:16,975 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:21:16,977 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:21:17,627 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:21:17,933 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:21:17,934 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-03 02:21:17,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:21:17 BoogieIcfgContainer [2022-11-03 02:21:17,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:21:17,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:21:17,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:21:17,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:21:17,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:21:16" (1/3) ... [2022-11-03 02:21:17,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe641c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:21:17, skipping insertion in model container [2022-11-03 02:21:17,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:16" (2/3) ... [2022-11-03 02:21:17,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe641c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:21:17, skipping insertion in model container [2022-11-03 02:21:17,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:21:17" (3/3) ... [2022-11-03 02:21:17,949 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2022-11-03 02:21:17,961 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:21:17,973 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:21:17,974 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:21:17,974 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:21:18,106 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-03 02:21:18,170 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:21:18,191 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 265 transitions, 562 flow [2022-11-03 02:21:18,196 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 265 transitions, 562 flow [2022-11-03 02:21:18,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 265 transitions, 562 flow [2022-11-03 02:21:18,397 INFO L130 PetriNetUnfolder]: 22/261 cut-off events. [2022-11-03 02:21:18,398 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-03 02:21:18,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 261 events. 22/261 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 125 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 222. Up to 2 conditions per place. [2022-11-03 02:21:18,414 INFO L118 LiptonReduction]: Number of co-enabled transitions 1824 [2022-11-03 02:21:32,708 INFO L133 LiptonReduction]: Checked pairs total: 3279 [2022-11-03 02:21:32,709 INFO L135 LiptonReduction]: Total number of compositions: 267 [2022-11-03 02:21:32,718 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 42 transitions, 116 flow [2022-11-03 02:21:32,798 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 527 states, 526 states have (on average 4.098859315589354) internal successors, (2156), 526 states have internal predecessors, (2156), 0 states have call successors, (0), 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:21:32,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:21:32,832 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;@52a41565, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:21:32,833 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-03 02:21:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 527 states, 526 states have (on average 4.098859315589354) internal successors, (2156), 526 states have internal predecessors, (2156), 0 states have call successors, (0), 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:21:32,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:21:32,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:32,860 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] [2022-11-03 02:21:32,861 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 2 more)] === [2022-11-03 02:21:32,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash -353804613, now seen corresponding path program 1 times [2022-11-03 02:21:32,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:32,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291671306] [2022-11-03 02:21:32,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:32,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:33,734 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:21:33,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:33,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291671306] [2022-11-03 02:21:33,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291671306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:33,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:33,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:21:33,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072083405] [2022-11-03 02:21:33,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:33,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:21:33,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:33,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:21:33,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:21:33,782 INFO L87 Difference]: Start difference. First operand has 527 states, 526 states have (on average 4.098859315589354) internal successors, (2156), 526 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:33,990 INFO L93 Difference]: Finished difference Result 778 states and 3201 transitions. [2022-11-03 02:21:33,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:21:33,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 02:21:33,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:34,035 INFO L225 Difference]: With dead ends: 778 [2022-11-03 02:21:34,036 INFO L226 Difference]: Without dead ends: 749 [2022-11-03 02:21:34,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:21:34,042 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:34,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 12 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:21:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2022-11-03 02:21:34,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2022-11-03 02:21:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 748 states have (on average 4.124331550802139) internal successors, (3085), 748 states have internal predecessors, (3085), 0 states have call successors, (0), 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:21:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 3085 transitions. [2022-11-03 02:21:34,198 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 3085 transitions. Word has length 28 [2022-11-03 02:21:34,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:34,199 INFO L495 AbstractCegarLoop]: Abstraction has 749 states and 3085 transitions. [2022-11-03 02:21:34,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 3085 transitions. [2022-11-03 02:21:34,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:21:34,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:34,206 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] [2022-11-03 02:21:34,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:21:34,207 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:21:34,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:34,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1081794123, now seen corresponding path program 1 times [2022-11-03 02:21:34,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:34,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189523798] [2022-11-03 02:21:34,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:34,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:34,411 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:21:34,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:34,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189523798] [2022-11-03 02:21:34,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189523798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:34,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:34,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:21:34,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313151681] [2022-11-03 02:21:34,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:34,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:21:34,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:34,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:21:34,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:21:34,424 INFO L87 Difference]: Start difference. First operand 749 states and 3085 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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:21:34,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:34,563 INFO L93 Difference]: Finished difference Result 1099 states and 4315 transitions. [2022-11-03 02:21:34,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:21:34,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-03 02:21:34,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:34,575 INFO L225 Difference]: With dead ends: 1099 [2022-11-03 02:21:34,575 INFO L226 Difference]: Without dead ends: 1071 [2022-11-03 02:21:34,576 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:21:34,579 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:34,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:21:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2022-11-03 02:21:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 947. [2022-11-03 02:21:34,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 946 states have (on average 4.056025369978858) internal successors, (3837), 946 states have internal predecessors, (3837), 0 states have call successors, (0), 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:21:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 3837 transitions. [2022-11-03 02:21:34,632 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 3837 transitions. Word has length 30 [2022-11-03 02:21:34,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:34,633 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 3837 transitions. [2022-11-03 02:21:34,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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:21:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 3837 transitions. [2022-11-03 02:21:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:21:34,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:34,638 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] [2022-11-03 02:21:34,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:21:34,639 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:21:34,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:34,639 INFO L85 PathProgramCache]: Analyzing trace with hash -828634621, now seen corresponding path program 1 times [2022-11-03 02:21:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:34,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735781224] [2022-11-03 02:21:34,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:34,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:34,802 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:21:34,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:34,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735781224] [2022-11-03 02:21:34,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735781224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:34,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:34,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:21:34,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469833967] [2022-11-03 02:21:34,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:34,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:21:34,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:34,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:21:34,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:21:34,811 INFO L87 Difference]: Start difference. First operand 947 states and 3837 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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:21:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:34,932 INFO L93 Difference]: Finished difference Result 1299 states and 5032 transitions. [2022-11-03 02:21:34,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:21:34,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-03 02:21:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:34,944 INFO L225 Difference]: With dead ends: 1299 [2022-11-03 02:21:34,945 INFO L226 Difference]: Without dead ends: 1239 [2022-11-03 02:21:34,945 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:21:34,946 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:34,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 8 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:21:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2022-11-03 02:21:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1149. [2022-11-03 02:21:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 3.9634146341463414) internal successors, (4550), 1148 states have internal predecessors, (4550), 0 states have call successors, (0), 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:21:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 4550 transitions. [2022-11-03 02:21:35,035 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 4550 transitions. Word has length 30 [2022-11-03 02:21:35,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:35,035 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 4550 transitions. [2022-11-03 02:21:35,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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:21:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 4550 transitions. [2022-11-03 02:21:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:21:35,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:35,041 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] [2022-11-03 02:21:35,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:21:35,042 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:21:35,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:35,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1399564290, now seen corresponding path program 1 times [2022-11-03 02:21:35,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:35,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902808907] [2022-11-03 02:21:35,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:35,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:21:35,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:35,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902808907] [2022-11-03 02:21:35,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902808907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:35,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:35,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:21:35,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385976192] [2022-11-03 02:21:35,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:35,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:21:35,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:35,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:21:35,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:21:35,246 INFO L87 Difference]: Start difference. First operand 1149 states and 4550 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:35,467 INFO L93 Difference]: Finished difference Result 2220 states and 8210 transitions. [2022-11-03 02:21:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:21:35,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-03 02:21:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:35,492 INFO L225 Difference]: With dead ends: 2220 [2022-11-03 02:21:35,494 INFO L226 Difference]: Without dead ends: 2116 [2022-11-03 02:21:35,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:21:35,497 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 78 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:35,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 23 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:21:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2022-11-03 02:21:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1389. [2022-11-03 02:21:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1388 states have (on average 3.9373198847262247) internal successors, (5465), 1388 states have internal predecessors, (5465), 0 states have call successors, (0), 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:21:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 5465 transitions. [2022-11-03 02:21:35,583 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 5465 transitions. Word has length 31 [2022-11-03 02:21:35,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:35,584 INFO L495 AbstractCegarLoop]: Abstraction has 1389 states and 5465 transitions. [2022-11-03 02:21:35,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 5465 transitions. [2022-11-03 02:21:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:21:35,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:35,593 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] [2022-11-03 02:21:35,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:21:35,599 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:21:35,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:35,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1630381288, now seen corresponding path program 1 times [2022-11-03 02:21:35,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:35,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014404] [2022-11-03 02:21:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:35,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:21:35,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:35,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014404] [2022-11-03 02:21:35,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:35,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:35,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:21:35,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626875246] [2022-11-03 02:21:35,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:35,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:21:35,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:35,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:21:35,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:21:35,868 INFO L87 Difference]: Start difference. First operand 1389 states and 5465 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:36,082 INFO L93 Difference]: Finished difference Result 2739 states and 10005 transitions. [2022-11-03 02:21:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:21:36,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-03 02:21:36,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:36,102 INFO L225 Difference]: With dead ends: 2739 [2022-11-03 02:21:36,102 INFO L226 Difference]: Without dead ends: 2387 [2022-11-03 02:21:36,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:21:36,104 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 71 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:36,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 18 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:21:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2022-11-03 02:21:36,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 1701. [2022-11-03 02:21:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 3.91) internal successors, (6647), 1700 states have internal predecessors, (6647), 0 states have call successors, (0), 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:21:36,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 6647 transitions. [2022-11-03 02:21:36,200 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 6647 transitions. Word has length 31 [2022-11-03 02:21:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:36,201 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 6647 transitions. [2022-11-03 02:21:36,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 6647 transitions. [2022-11-03 02:21:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 02:21:36,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:36,209 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] [2022-11-03 02:21:36,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:21:36,209 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:21:36,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:36,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1547302429, now seen corresponding path program 1 times [2022-11-03 02:21:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:36,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367635145] [2022-11-03 02:21:36,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:21:36,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:36,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367635145] [2022-11-03 02:21:36,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367635145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:36,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:36,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:21:36,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143945087] [2022-11-03 02:21:36,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:36,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:21:36,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:36,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:21:36,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:21:36,846 INFO L87 Difference]: Start difference. First operand 1701 states and 6647 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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:21:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:37,171 INFO L93 Difference]: Finished difference Result 2673 states and 9972 transitions. [2022-11-03 02:21:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:21:37,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-03 02:21:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:37,192 INFO L225 Difference]: With dead ends: 2673 [2022-11-03 02:21:37,192 INFO L226 Difference]: Without dead ends: 2544 [2022-11-03 02:21:37,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:21:37,193 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 137 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:37,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 4 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:21:37,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2022-11-03 02:21:37,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 1703. [2022-11-03 02:21:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1702 states have (on average 3.9071680376028204) internal successors, (6650), 1702 states have internal predecessors, (6650), 0 states have call successors, (0), 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:21:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 6650 transitions. [2022-11-03 02:21:37,297 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 6650 transitions. Word has length 32 [2022-11-03 02:21:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:37,299 INFO L495 AbstractCegarLoop]: Abstraction has 1703 states and 6650 transitions. [2022-11-03 02:21:37,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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:21:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 6650 transitions. [2022-11-03 02:21:37,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 02:21:37,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:37,307 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] [2022-11-03 02:21:37,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:21:37,307 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:21:37,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:37,308 INFO L85 PathProgramCache]: Analyzing trace with hash 796526167, now seen corresponding path program 1 times [2022-11-03 02:21:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:37,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695453221] [2022-11-03 02:21:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:21:37,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:37,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695453221] [2022-11-03 02:21:37,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695453221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:37,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:37,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:21:37,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947216745] [2022-11-03 02:21:37,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:37,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:21:37,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:37,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:21:37,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:21:37,808 INFO L87 Difference]: Start difference. First operand 1703 states and 6650 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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:21:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:38,095 INFO L93 Difference]: Finished difference Result 1945 states and 7331 transitions. [2022-11-03 02:21:38,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:21:38,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-03 02:21:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:38,111 INFO L225 Difference]: With dead ends: 1945 [2022-11-03 02:21:38,111 INFO L226 Difference]: Without dead ends: 1794 [2022-11-03 02:21:38,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:21:38,113 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 77 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:38,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 5 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:21:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2022-11-03 02:21:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1704. [2022-11-03 02:21:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 3.9048737522019965) internal successors, (6650), 1703 states have internal predecessors, (6650), 0 states have call successors, (0), 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:21:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 6650 transitions. [2022-11-03 02:21:38,199 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 6650 transitions. Word has length 32 [2022-11-03 02:21:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:38,200 INFO L495 AbstractCegarLoop]: Abstraction has 1704 states and 6650 transitions. [2022-11-03 02:21:38,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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:21:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 6650 transitions. [2022-11-03 02:21:38,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:21:38,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:38,208 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] [2022-11-03 02:21:38,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:21:38,208 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:21:38,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1976287508, now seen corresponding path program 1 times [2022-11-03 02:21:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:38,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943397975] [2022-11-03 02:21:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:38,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:21:38,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:38,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943397975] [2022-11-03 02:21:38,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943397975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:38,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:38,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:21:38,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529485731] [2022-11-03 02:21:38,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:38,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:21:38,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:38,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:21:38,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:21:38,738 INFO L87 Difference]: Start difference. First operand 1704 states and 6650 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:38,998 INFO L93 Difference]: Finished difference Result 1864 states and 7200 transitions. [2022-11-03 02:21:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:21:38,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 02:21:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:39,029 INFO L225 Difference]: With dead ends: 1864 [2022-11-03 02:21:39,029 INFO L226 Difference]: Without dead ends: 1493 [2022-11-03 02:21:39,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:21:39,030 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 80 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:39,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 2 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:21:39,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2022-11-03 02:21:39,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1253. [2022-11-03 02:21:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 3.9400958466453675) internal successors, (4933), 1252 states have internal predecessors, (4933), 0 states have call successors, (0), 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:21:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 4933 transitions. [2022-11-03 02:21:39,092 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 4933 transitions. Word has length 33 [2022-11-03 02:21:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:39,093 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 4933 transitions. [2022-11-03 02:21:39,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 4933 transitions. [2022-11-03 02:21:39,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:21:39,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:39,125 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] [2022-11-03 02:21:39,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:21:39,125 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:21:39,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:39,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1258868108, now seen corresponding path program 1 times [2022-11-03 02:21:39,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:39,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326250034] [2022-11-03 02:21:39,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:39,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:21:39,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:39,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326250034] [2022-11-03 02:21:39,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326250034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:39,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:39,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:21:39,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209747973] [2022-11-03 02:21:39,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:39,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:21:39,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:39,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:21:39,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:21:39,578 INFO L87 Difference]: Start difference. First operand 1253 states and 4933 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:39,749 INFO L93 Difference]: Finished difference Result 1131 states and 4313 transitions. [2022-11-03 02:21:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:21:39,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 02:21:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:39,762 INFO L225 Difference]: With dead ends: 1131 [2022-11-03 02:21:39,763 INFO L226 Difference]: Without dead ends: 890 [2022-11-03 02:21:39,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:21:39,764 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 40 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:39,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:21:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2022-11-03 02:21:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2022-11-03 02:21:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 3.953880764904387) internal successors, (3515), 889 states have internal predecessors, (3515), 0 states have call successors, (0), 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:21:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 3515 transitions. [2022-11-03 02:21:39,802 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 3515 transitions. Word has length 33 [2022-11-03 02:21:39,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:39,802 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 3515 transitions. [2022-11-03 02:21:39,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 3515 transitions. [2022-11-03 02:21:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:21:39,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:39,807 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] [2022-11-03 02:21:39,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:21:39,807 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:21:39,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:39,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2075716020, now seen corresponding path program 1 times [2022-11-03 02:21:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:39,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973649993] [2022-11-03 02:21:39,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:39,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:21:40,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:40,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973649993] [2022-11-03 02:21:40,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973649993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:40,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:40,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:21:40,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009531093] [2022-11-03 02:21:40,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:40,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:21:40,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:40,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:21:40,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:21:40,166 INFO L87 Difference]: Start difference. First operand 890 states and 3515 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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:21:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:40,405 INFO L93 Difference]: Finished difference Result 1364 states and 5429 transitions. [2022-11-03 02:21:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:21:40,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-11-03 02:21:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:40,414 INFO L225 Difference]: With dead ends: 1364 [2022-11-03 02:21:40,414 INFO L226 Difference]: Without dead ends: 1364 [2022-11-03 02:21:40,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:21:40,415 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 63 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:40,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 24 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:21:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-11-03 02:21:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 798. [2022-11-03 02:21:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 3.9109159347553324) internal successors, (3117), 797 states have internal predecessors, (3117), 0 states have call successors, (0), 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:21:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3117 transitions. [2022-11-03 02:21:40,483 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3117 transitions. Word has length 35 [2022-11-03 02:21:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:40,486 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 3117 transitions. [2022-11-03 02:21:40,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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:21:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3117 transitions. [2022-11-03 02:21:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:21:40,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:40,493 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] [2022-11-03 02:21:40,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:21:40,494 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:21:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:40,495 INFO L85 PathProgramCache]: Analyzing trace with hash 165287276, now seen corresponding path program 1 times [2022-11-03 02:21:40,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:40,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441630484] [2022-11-03 02:21:40,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:40,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:21:40,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:40,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441630484] [2022-11-03 02:21:40,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441630484] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:21:40,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566179639] [2022-11-03 02:21:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:40,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:21:40,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:21:40,796 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:21:40,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:21:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:41,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:21:41,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:21:41,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:41,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566179639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:41,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:21:41,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-03 02:21:41,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547436009] [2022-11-03 02:21:41,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:41,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:21:41,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:41,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:21:41,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:21:41,142 INFO L87 Difference]: Start difference. First operand 798 states and 3117 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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:21:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:41,387 INFO L93 Difference]: Finished difference Result 1556 states and 6167 transitions. [2022-11-03 02:21:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:21:41,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-11-03 02:21:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:41,397 INFO L225 Difference]: With dead ends: 1556 [2022-11-03 02:21:41,397 INFO L226 Difference]: Without dead ends: 1556 [2022-11-03 02:21:41,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:21:41,398 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 89 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:41,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 24 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:21:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2022-11-03 02:21:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1046. [2022-11-03 02:21:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1045 states have (on average 3.9473684210526314) internal successors, (4125), 1045 states have internal predecessors, (4125), 0 states have call successors, (0), 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:21:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 4125 transitions. [2022-11-03 02:21:41,453 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 4125 transitions. Word has length 35 [2022-11-03 02:21:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:41,454 INFO L495 AbstractCegarLoop]: Abstraction has 1046 states and 4125 transitions. [2022-11-03 02:21:41,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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:21:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 4125 transitions. [2022-11-03 02:21:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:21:41,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:41,459 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] [2022-11-03 02:21:41,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:41,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 02:21:41,675 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:21:41,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:41,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1051499578, now seen corresponding path program 2 times [2022-11-03 02:21:41,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:41,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705612087] [2022-11-03 02:21:41,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:41,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:21:42,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:42,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705612087] [2022-11-03 02:21:42,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705612087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:42,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:42,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:21:42,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020222506] [2022-11-03 02:21:42,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:42,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:21:42,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:21:42,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:21:42,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:21:42,149 INFO L87 Difference]: Start difference. First operand 1046 states and 4125 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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:21:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:42,490 INFO L93 Difference]: Finished difference Result 1338 states and 5293 transitions. [2022-11-03 02:21:42,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:21:42,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-11-03 02:21:42,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:42,499 INFO L225 Difference]: With dead ends: 1338 [2022-11-03 02:21:42,499 INFO L226 Difference]: Without dead ends: 1338 [2022-11-03 02:21:42,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:21:42,500 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 46 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:42,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 2 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:21:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-11-03 02:21:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 966. [2022-11-03 02:21:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 3.9181347150259067) internal successors, (3781), 965 states have internal predecessors, (3781), 0 states have call successors, (0), 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:21:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 3781 transitions. [2022-11-03 02:21:42,553 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 3781 transitions. Word has length 35 [2022-11-03 02:21:42,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:42,554 INFO L495 AbstractCegarLoop]: Abstraction has 966 states and 3781 transitions. [2022-11-03 02:21:42,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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:21:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 3781 transitions. [2022-11-03 02:21:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 02:21:42,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:42,560 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:21:42,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:21:42,561 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:21:42,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:42,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1773451964, now seen corresponding path program 1 times [2022-11-03 02:21:42,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:21:42,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896115616] [2022-11-03 02:21:42,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:42,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:21:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:21:46,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:21:46,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896115616] [2022-11-03 02:21:46,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896115616] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:21:46,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857223266] [2022-11-03 02:21:46,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:46,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:21:46,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:21:46,682 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:21:46,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:21:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:46,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-03 02:21:46,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:48,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:21:48,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:21:48,318 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 02:21:48,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 49 [2022-11-03 02:21:48,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-11-03 02:21:48,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:21:48,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:21:48,788 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:21:48,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2022-11-03 02:21:48,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:21:48,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:21:48,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2022-11-03 02:21:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:21:49,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:21:50,212 INFO L356 Elim1Store]: treesize reduction 19, result has 92.8 percent of original size [2022-11-03 02:21:50,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 740 treesize of output 809 [2022-11-03 02:21:50,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 553 treesize of output 505 [2022-11-03 02:21:50,291 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:21:50,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 505 treesize of output 450 [2022-11-03 02:21:50,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:21:50,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 433 treesize of output 414 [2022-11-03 02:21:50,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 397 treesize of output 373 [2022-11-03 02:22:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:22:00,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857223266] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:00,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1976347302] [2022-11-03 02:22:00,865 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:22:00,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:22:00,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 33 [2022-11-03 02:22:00,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264266115] [2022-11-03 02:22:00,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:22:00,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 02:22:00,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:22:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 02:22:00,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1048, Unknown=4, NotChecked=0, Total=1190 [2022-11-03 02:22:00,873 INFO L87 Difference]: Start difference. First operand 966 states and 3781 transitions. Second operand has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 0 states have call successors, (0), 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:22:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:22:08,865 INFO L93 Difference]: Finished difference Result 3196 states and 12767 transitions. [2022-11-03 02:22:08,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-03 02:22:08,867 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 0 states have call successors, (0), 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:22:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:22:08,885 INFO L225 Difference]: With dead ends: 3196 [2022-11-03 02:22:08,885 INFO L226 Difference]: Without dead ends: 3188 [2022-11-03 02:22:08,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=499, Invalid=3120, Unknown=41, NotChecked=0, Total=3660 [2022-11-03 02:22:08,887 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 249 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 609 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:22:08,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 15 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1057 Invalid, 0 Unknown, 609 Unchecked, 1.8s Time] [2022-11-03 02:22:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2022-11-03 02:22:08,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 1216. [2022-11-03 02:22:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1215 states have (on average 3.8395061728395063) internal successors, (4665), 1215 states have internal predecessors, (4665), 0 states have call successors, (0), 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:22:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 4665 transitions. [2022-11-03 02:22:08,961 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 4665 transitions. Word has length 37 [2022-11-03 02:22:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:22:08,961 INFO L495 AbstractCegarLoop]: Abstraction has 1216 states and 4665 transitions. [2022-11-03 02:22:08,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 34 states have internal predecessors, (91), 0 states have call successors, (0), 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:22:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 4665 transitions. [2022-11-03 02:22:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 02:22:08,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:22:08,966 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:22:09,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:22:09,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 02:22:09,187 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:22:09,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:22:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash 127518914, now seen corresponding path program 2 times [2022-11-03 02:22:09,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:22:09,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951471764] [2022-11-03 02:22:09,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:22:09,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:22:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:22:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:13,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:22:13,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951471764] [2022-11-03 02:22:13,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951471764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:22:13,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705228133] [2022-11-03 02:22:13,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:22:13,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:22:13,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:22:13,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:22:13,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:22:13,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:22:13,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:22:13,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-03 02:22:13,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:22:14,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:22:14,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:22:14,845 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 02:22:14,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 49 [2022-11-03 02:22:14,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2022-11-03 02:22:15,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:22:15,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:22:15,277 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:22:15,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2022-11-03 02:22:15,548 INFO L356 Elim1Store]: treesize reduction 29, result has 45.3 percent of original size [2022-11-03 02:22:15,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 34 [2022-11-03 02:22:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:22:15,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:16,760 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_608 (Array Int Int))) (< 0 (+ c_~total~0 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_608) c_~q2~0.base) .cse0)))) (forall ((v_ArrVal_608 (Array Int Int))) (<= (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_608) c_~q2~0.base) .cse0)) 0)))) is different from false [2022-11-03 02:22:16,801 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_608 (Array Int Int))) (< 0 (+ c_~total~0 .cse0 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_608) c_~q2~0.base) .cse1)))) (forall ((v_ArrVal_608 (Array Int Int))) (<= (+ c_~total~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_608) c_~q2~0.base) .cse1)) 0)))) (not (<= 0 c_~q1_front~0)) (not (< c_~q1_front~0 c_~n1~0))) is different from false [2022-11-03 02:22:16,850 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_607))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_608) c_~q2~0.base) .cse1) (select (select .cse0 c_~q1~0.base) .cse2) c_~total~0)) 0)) (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (< 0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_607))) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_608) c_~q2~0.base) .cse1) (select (select .cse3 c_~q1~0.base) .cse2) c_~total~0 1)))))) (not (<= 0 c_~q1_front~0)) (not (< c_~q1_front~0 c_~n1~0))) is different from false [2022-11-03 02:22:17,963 INFO L356 Elim1Store]: treesize reduction 19, result has 96.0 percent of original size [2022-11-03 02:22:17,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1006 treesize of output 1223 [2022-11-03 02:22:18,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 761 treesize of output 713 [2022-11-03 02:22:18,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:22:18,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 713 treesize of output 658 [2022-11-03 02:22:18,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:22:18,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 641 treesize of output 586 [2022-11-03 02:22:18,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 569 treesize of output 521 [2022-11-03 02:29:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-03 02:29:49,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705228133] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:29:49,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [496771505] [2022-11-03 02:29:49,032 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:29:49,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:29:49,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 33 [2022-11-03 02:29:49,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811241421] [2022-11-03 02:29:49,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:29:49,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 02:29:49,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:49,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 02:29:49,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=903, Unknown=4, NotChecked=186, Total=1190 [2022-11-03 02:29:49,039 INFO L87 Difference]: Start difference. First operand 1216 states and 4665 transitions. Second operand has 35 states, 34 states have (on average 2.735294117647059) internal successors, (93), 34 states have internal predecessors, (93), 0 states have call successors, (0), 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:29:54,895 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~total~0 0) (or (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_607))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_608) c_~q2~0.base) .cse1) (select (select .cse0 c_~q1~0.base) .cse2) c_~total~0)) 0)) (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (< 0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_607))) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_608) c_~q2~0.base) .cse1) (select (select .cse3 c_~q1~0.base) .cse2) c_~total~0 1)))))) (not (<= 0 c_~q1_front~0)) (not (< c_~q1_front~0 c_~n1~0))) (< 0 (+ c_~total~0 1))) is different from false [2022-11-03 02:29:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:57,866 INFO L93 Difference]: Finished difference Result 3553 states and 14208 transitions. [2022-11-03 02:29:57,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-03 02:29:57,867 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.735294117647059) internal successors, (93), 34 states have internal predecessors, (93), 0 states have call successors, (0), 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:29:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:57,887 INFO L225 Difference]: With dead ends: 3553 [2022-11-03 02:29:57,888 INFO L226 Difference]: Without dead ends: 3540 [2022-11-03 02:29:57,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=406, Invalid=3387, Unknown=5, NotChecked=492, Total=4290 [2022-11-03 02:29:57,890 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 451 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2325 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:57,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 19 Invalid, 3619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1202 Invalid, 0 Unknown, 2325 Unchecked, 2.1s Time] [2022-11-03 02:29:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3540 states. [2022-11-03 02:29:57,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3540 to 1735. [2022-11-03 02:29:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1734 states have (on average 3.798731257208766) internal successors, (6587), 1734 states have internal predecessors, (6587), 0 states have call successors, (0), 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:29:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 6587 transitions. [2022-11-03 02:29:57,982 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 6587 transitions. Word has length 37 [2022-11-03 02:29:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:57,983 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 6587 transitions. [2022-11-03 02:29:57,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.735294117647059) internal successors, (93), 34 states have internal predecessors, (93), 0 states have call successors, (0), 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:29:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 6587 transitions. [2022-11-03 02:29:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 02:29:57,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:57,990 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:29:58,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:58,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 02:29:58,198 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 02:29:58,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:58,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2018651846, now seen corresponding path program 3 times [2022-11-03 02:29:58,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:58,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327134715] [2022-11-03 02:29:58,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:58,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:30:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:30:03,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:30:03,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327134715] [2022-11-03 02:30:03,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327134715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:30:03,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803889784] [2022-11-03 02:30:03,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:30:03,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:30:03,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:30:03,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:30:03,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5072ea18-39d2-4014-8e3d-493b048daf67/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:30:03,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:30:03,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:30:03,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 103 conjunts are in the unsatisfiable core [2022-11-03 02:30:03,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:30:03,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:30:03,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:30:03,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:30:03,642 INFO L356 Elim1Store]: treesize reduction 90, result has 29.7 percent of original size [2022-11-03 02:30:03,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 43 [2022-11-03 02:30:03,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 02:30:03,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:30:03,990 INFO L356 Elim1Store]: treesize reduction 70, result has 28.6 percent of original size [2022-11-03 02:30:03,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 27 treesize of output 45 [2022-11-03 02:30:04,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:30:04,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:30:04,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:30:04,444 INFO L356 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2022-11-03 02:30:04,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 21 [2022-11-03 02:30:04,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:30:04,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:30:05,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:30:06,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:30:06,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:30:06,041 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:30:06,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 45 [2022-11-03 02:30:06,751 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 02:30:06,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 58 [2022-11-03 02:30:06,784 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-03 02:30:06,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 14 [2022-11-03 02:30:06,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:30:07,003 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:30:07,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2022-11-03 02:30:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:30:07,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:30:11,361 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:30:11,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 330 treesize of output 198 [2022-11-03 02:30:12,563 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:30:12,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14719747178 treesize of output 14550916914