./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-prod-cons.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_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/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_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/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_257e0cdf-53c7-42fc-a907-4fcabc17d699/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 f9b434f3343269d91303305376bff127738dc22172486554888e346753333fd7 --- 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:26:49,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:26:49,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:26:49,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:26:49,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:26:49,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:26:49,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:26:49,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:26:49,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:26:49,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:26:49,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:26:49,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:26:49,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:26:49,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:26:49,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:26:49,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:26:49,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:26:49,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:26:49,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:26:49,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:26:49,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:26:49,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:26:49,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:26:49,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:26:49,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:26:49,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:26:49,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:26:49,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:26:49,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:26:49,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:26:49,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:26:49,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:26:49,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:26:49,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:26:49,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:26:49,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:26:49,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:26:49,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:26:49,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:26:49,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:26:49,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:26:49,317 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:26:49,345 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:26:49,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:26:49,347 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:26:49,347 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:26:49,348 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:26:49,349 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:26:49,349 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:26:49,349 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:26:49,349 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:26:49,349 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:26:49,350 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:26:49,351 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:26:49,351 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:26:49,351 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:26:49,351 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:26:49,351 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:26:49,352 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:26:49,352 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:26:49,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:26:49,353 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:26:49,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:26:49,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:26:49,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:26:49,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:26:49,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:26:49,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:26:49,355 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:26:49,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:26:49,356 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:26:49,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:26:49,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:26:49,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:26:49,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:26:49,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:26:49,357 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:26:49,357 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:26:49,357 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:26:49,358 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:26:49,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:26:49,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:26:49,359 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:26:49,359 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_257e0cdf-53c7-42fc-a907-4fcabc17d699/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_257e0cdf-53c7-42fc-a907-4fcabc17d699/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 -> f9b434f3343269d91303305376bff127738dc22172486554888e346753333fd7 [2022-11-03 02:26:49,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:26:49,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:26:49,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:26:49,715 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:26:49,716 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:26:49,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c [2022-11-03 02:26:49,810 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/data/fbd624b09/272c48eac0fb45149212f1f23b7e5b1a/FLAGa774a7b9b [2022-11-03 02:26:50,243 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:26:50,244 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c [2022-11-03 02:26:50,256 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/data/fbd624b09/272c48eac0fb45149212f1f23b7e5b1a/FLAGa774a7b9b [2022-11-03 02:26:50,276 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/data/fbd624b09/272c48eac0fb45149212f1f23b7e5b1a [2022-11-03 02:26:50,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:26:50,283 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:26:50,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:26:50,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:26:50,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:26:50,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703f78a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50, skipping insertion in model container [2022-11-03 02:26:50,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:26:50,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:26:50,588 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_257e0cdf-53c7-42fc-a907-4fcabc17d699/sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c[3056,3069] [2022-11-03 02:26:50,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:26:50,612 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:26:50,654 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_257e0cdf-53c7-42fc-a907-4fcabc17d699/sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c[3056,3069] [2022-11-03 02:26:50,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:26:50,675 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:26:50,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50 WrapperNode [2022-11-03 02:26:50,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:26:50,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:26:50,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:26:50,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:26:50,685 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:26:50" (1/1) ... [2022-11-03 02:26:50,705 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:26:50" (1/1) ... [2022-11-03 02:26:50,739 INFO L138 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 166 [2022-11-03 02:26:50,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:26:50,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:26:50,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:26:50,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:26:50,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,775 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:26:50,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:26:50,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:26:50,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:26:50,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (1/1) ... [2022-11-03 02:26:50,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:26:50,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:26:50,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:26:50,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:26:50,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:26:50,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:26:50,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:26:50,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:26:50,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 02:26:50,875 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 02:26:50,875 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 02:26:50,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 02:26:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 02:26:50,876 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 02:26:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:26:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 02:26:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 02:26:50,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:26:50,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:26:50,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:26:50,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:26:50,879 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:26:50,976 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:26:50,978 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:26:51,263 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:26:51,363 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:26:51,363 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 02:26:51,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:26:51 BoogieIcfgContainer [2022-11-03 02:26:51,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:26:51,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:26:51,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:26:51,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:26:51,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:26:50" (1/3) ... [2022-11-03 02:26:51,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1e1746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:26:51, skipping insertion in model container [2022-11-03 02:26:51,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:26:50" (2/3) ... [2022-11-03 02:26:51,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1e1746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:26:51, skipping insertion in model container [2022-11-03 02:26:51,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:26:51" (3/3) ... [2022-11-03 02:26:51,376 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2022-11-03 02:26:51,401 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:26:51,424 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:26:51,424 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:26:51,424 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:26:51,581 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-03 02:26:51,617 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:26:51,629 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 156 transitions, 336 flow [2022-11-03 02:26:51,634 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 156 transitions, 336 flow [2022-11-03 02:26:51,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 156 transitions, 336 flow [2022-11-03 02:26:51,726 INFO L130 PetriNetUnfolder]: 11/153 cut-off events. [2022-11-03 02:26:51,751 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-03 02:26:51,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 153 events. 11/153 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 122. Up to 3 conditions per place. [2022-11-03 02:26:51,761 INFO L118 LiptonReduction]: Number of co-enabled transitions 1082 [2022-11-03 02:26:58,941 INFO L133 LiptonReduction]: Checked pairs total: 2350 [2022-11-03 02:26:58,942 INFO L135 LiptonReduction]: Total number of compositions: 156 [2022-11-03 02:26:58,950 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 29 transitions, 82 flow [2022-11-03 02:26:58,979 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 157 states, 156 states have (on average 2.8076923076923075) internal successors, (438), 156 states have internal predecessors, (438), 0 states have call successors, (0), 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:26:58,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:26:59,004 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;@2f5be1e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:26:59,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-03 02:26:59,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 156 states have (on average 2.8076923076923075) internal successors, (438), 156 states have internal predecessors, (438), 0 states have call successors, (0), 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:26:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:26:59,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:26:59,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:26:59,018 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 1 more)] === [2022-11-03 02:26:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:26:59,024 INFO L85 PathProgramCache]: Analyzing trace with hash 273962034, now seen corresponding path program 1 times [2022-11-03 02:26:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:26:59,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959166640] [2022-11-03 02:26:59,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:26:59,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:26:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:26:59,502 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:26:59,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:26:59,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959166640] [2022-11-03 02:26:59,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959166640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:26:59,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:26:59,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:26:59,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029451475] [2022-11-03 02:26:59,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:26:59,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:26:59,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:26:59,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:26:59,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:26:59,535 INFO L87 Difference]: Start difference. First operand has 157 states, 156 states have (on average 2.8076923076923075) internal successors, (438), 156 states have internal predecessors, (438), 0 states have call successors, (0), 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 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:26:59,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:26:59,672 INFO L93 Difference]: Finished difference Result 167 states and 448 transitions. [2022-11-03 02:26:59,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:26:59,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:26:59,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:26:59,685 INFO L225 Difference]: With dead ends: 167 [2022-11-03 02:26:59,686 INFO L226 Difference]: Without dead ends: 167 [2022-11-03 02:26:59,687 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:26:59,690 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:26:59,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 8 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:26:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-03 02:26:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 147. [2022-11-03 02:26:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.73972602739726) internal successors, (400), 146 states have internal predecessors, (400), 0 states have call successors, (0), 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:26:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 400 transitions. [2022-11-03 02:26:59,767 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 400 transitions. Word has length 19 [2022-11-03 02:26:59,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:26:59,768 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 400 transitions. [2022-11-03 02:26:59,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:26:59,768 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 400 transitions. [2022-11-03 02:26:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:26:59,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:26:59,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:26:59,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:26:59,771 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 1 more)] === [2022-11-03 02:26:59,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:26:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash -323331330, now seen corresponding path program 2 times [2022-11-03 02:26:59,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:26:59,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695412130] [2022-11-03 02:26:59,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:26:59,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:26:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:00,169 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:27:00,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:27:00,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695412130] [2022-11-03 02:27:00,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695412130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:27:00,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:27:00,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:27:00,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957031014] [2022-11-03 02:27:00,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:27:00,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:27:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:27:00,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:27:00,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:27:00,180 INFO L87 Difference]: Start difference. First operand 147 states and 400 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:27:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:27:00,403 INFO L93 Difference]: Finished difference Result 263 states and 708 transitions. [2022-11-03 02:27:00,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:27:00,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:27:00,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:27:00,406 INFO L225 Difference]: With dead ends: 263 [2022-11-03 02:27:00,406 INFO L226 Difference]: Without dead ends: 193 [2022-11-03 02:27:00,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:27:00,408 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:27:00,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 3 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:27:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-03 02:27:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 173. [2022-11-03 02:27:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 2.686046511627907) internal successors, (462), 172 states have internal predecessors, (462), 0 states have call successors, (0), 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:27:00,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 462 transitions. [2022-11-03 02:27:00,423 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 462 transitions. Word has length 19 [2022-11-03 02:27:00,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:27:00,423 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 462 transitions. [2022-11-03 02:27:00,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:27:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 462 transitions. [2022-11-03 02:27:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:27:00,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:27:00,425 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] [2022-11-03 02:27:00,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:27:00,426 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 1 more)] === [2022-11-03 02:27:00,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:27:00,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1568420006, now seen corresponding path program 1 times [2022-11-03 02:27:00,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:27:00,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518282859] [2022-11-03 02:27:00,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:27:00,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:27:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:00,622 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:27:00,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:27:00,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518282859] [2022-11-03 02:27:00,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518282859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:27:00,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:27:00,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:27:00,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207264759] [2022-11-03 02:27:00,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:27:00,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:27:00,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:27:00,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:27:00,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:27:00,625 INFO L87 Difference]: Start difference. First operand 173 states and 462 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:27:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:27:00,703 INFO L93 Difference]: Finished difference Result 181 states and 455 transitions. [2022-11-03 02:27:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:27:00,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 02:27:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:27:00,705 INFO L225 Difference]: With dead ends: 181 [2022-11-03 02:27:00,706 INFO L226 Difference]: Without dead ends: 167 [2022-11-03 02:27:00,706 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:27:00,707 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:27:00,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:27:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-03 02:27:00,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-11-03 02:27:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.572289156626506) internal successors, (427), 166 states have internal predecessors, (427), 0 states have call successors, (0), 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:27:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 427 transitions. [2022-11-03 02:27:00,724 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 427 transitions. Word has length 22 [2022-11-03 02:27:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:27:00,725 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 427 transitions. [2022-11-03 02:27:00,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:27:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 427 transitions. [2022-11-03 02:27:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:27:00,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:27:00,732 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] [2022-11-03 02:27:00,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:27:00,733 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 1 more)] === [2022-11-03 02:27:00,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:27:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1370437211, now seen corresponding path program 1 times [2022-11-03 02:27:00,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:27:00,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716620620] [2022-11-03 02:27:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:27:00,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:27:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:00,898 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:27:00,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:27:00,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716620620] [2022-11-03 02:27:00,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716620620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:27:00,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:27:00,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:27:00,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387399539] [2022-11-03 02:27:00,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:27:00,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:27:00,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:27:00,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:27:00,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:27:00,904 INFO L87 Difference]: Start difference. First operand 167 states and 427 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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:27:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:27:00,990 INFO L93 Difference]: Finished difference Result 199 states and 486 transitions. [2022-11-03 02:27:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:27:00,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-03 02:27:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:27:00,993 INFO L225 Difference]: With dead ends: 199 [2022-11-03 02:27:00,993 INFO L226 Difference]: Without dead ends: 168 [2022-11-03 02:27:00,994 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:27:00,998 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:27:00,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:27:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-03 02:27:01,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-11-03 02:27:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.562874251497006) internal successors, (428), 167 states have internal predecessors, (428), 0 states have call successors, (0), 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:27:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 428 transitions. [2022-11-03 02:27:01,016 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 428 transitions. Word has length 24 [2022-11-03 02:27:01,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:27:01,016 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 428 transitions. [2022-11-03 02:27:01,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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:27:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 428 transitions. [2022-11-03 02:27:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:27:01,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:27:01,018 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] [2022-11-03 02:27:01,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:27:01,019 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 1 more)] === [2022-11-03 02:27:01,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:27:01,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2034790713, now seen corresponding path program 1 times [2022-11-03 02:27:01,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:27:01,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107366074] [2022-11-03 02:27:01,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:27:01,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:27:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:27:02,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:27:02,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107366074] [2022-11-03 02:27:02,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107366074] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:27:02,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717108986] [2022-11-03 02:27:02,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:27:02,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:27:02,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:27:02,357 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:27:02,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:27:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:02,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 02:27:02,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:27:02,650 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 51 treesize of output 49 [2022-11-03 02:27:03,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:27:03,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:27:03,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-11-03 02:27:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:27:03,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:27:03,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_129 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:27:03,721 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (< (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:27:03,765 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:27:03,765 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 190 treesize of output 178 [2022-11-03 02:27:03,778 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 81 treesize of output 69 [2022-11-03 02:27:03,787 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 150 treesize of output 126 [2022-11-03 02:27:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 02:27:04,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717108986] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:27:04,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1384092684] [2022-11-03 02:27:04,278 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:27:04,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:27:04,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2022-11-03 02:27:04,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670881299] [2022-11-03 02:27:04,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:27:04,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 02:27:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:27:04,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 02:27:04,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=922, Unknown=2, NotChecked=126, Total=1190 [2022-11-03 02:27:04,288 INFO L87 Difference]: Start difference. First operand 168 states and 428 transitions. Second operand has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 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:27:06,253 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (forall ((v_ArrVal_129 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1)))) is different from false [2022-11-03 02:27:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:27:11,880 INFO L93 Difference]: Finished difference Result 1165 states and 2907 transitions. [2022-11-03 02:27:11,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-03 02:27:11,887 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 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 25 [2022-11-03 02:27:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:27:11,895 INFO L225 Difference]: With dead ends: 1165 [2022-11-03 02:27:11,895 INFO L226 Difference]: Without dead ends: 985 [2022-11-03 02:27:11,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 29 SyntacticMatches, 11 SemanticMatches, 101 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3323 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1473, Invalid=8436, Unknown=3, NotChecked=594, Total=10506 [2022-11-03 02:27:11,898 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 439 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 881 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:27:11,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 25 Invalid, 3339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2346 Invalid, 0 Unknown, 881 Unchecked, 2.2s Time] [2022-11-03 02:27:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2022-11-03 02:27:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 294. [2022-11-03 02:27:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.5017064846416384) internal successors, (733), 293 states have internal predecessors, (733), 0 states have call successors, (0), 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:27:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 733 transitions. [2022-11-03 02:27:11,919 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 733 transitions. Word has length 25 [2022-11-03 02:27:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:27:11,920 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 733 transitions. [2022-11-03 02:27:11,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 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:27:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 733 transitions. [2022-11-03 02:27:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 02:27:11,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:27:11,922 INFO L195 NwaCegarLoop]: trace histogram [2, 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:27:11,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:27:12,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:27:12,139 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 1 more)] === [2022-11-03 02:27:12,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:27:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1482791527, now seen corresponding path program 2 times [2022-11-03 02:27:12,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:27:12,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284133906] [2022-11-03 02:27:12,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:27:12,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:27:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:13,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:27:13,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:27:13,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284133906] [2022-11-03 02:27:13,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284133906] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:27:13,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984019348] [2022-11-03 02:27:13,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:27:13,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:27:13,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:27:13,507 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:27:13,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:27:13,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:27:13,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:27:13,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 02:27:13,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:27:13,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:13,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:27:13,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 7 [2022-11-03 02:27:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:27:14,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:27:14,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_178) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:27:14,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:27:14,227 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 50 treesize of output 46 [2022-11-03 02:27:14,233 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 13 treesize of output 7 [2022-11-03 02:27:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-03 02:27:14,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984019348] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:27:14,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1514251478] [2022-11-03 02:27:14,473 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:27:14,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:27:14,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 32 [2022-11-03 02:27:14,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620827938] [2022-11-03 02:27:14,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:27:14,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 02:27:14,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:27:14,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 02:27:14,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=868, Unknown=1, NotChecked=60, Total=1056 [2022-11-03 02:27:14,476 INFO L87 Difference]: Start difference. First operand 294 states and 733 transitions. Second operand has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 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:27:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:27:18,704 INFO L93 Difference]: Finished difference Result 769 states and 1871 transitions. [2022-11-03 02:27:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-03 02:27:18,707 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 02:27:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:27:18,711 INFO L225 Difference]: With dead ends: 769 [2022-11-03 02:27:18,711 INFO L226 Difference]: Without dead ends: 685 [2022-11-03 02:27:18,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=922, Invalid=4631, Unknown=1, NotChecked=146, Total=5700 [2022-11-03 02:27:18,713 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 431 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:27:18,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 3 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1632 Invalid, 0 Unknown, 79 Unchecked, 1.4s Time] [2022-11-03 02:27:18,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-11-03 02:27:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 257. [2022-11-03 02:27:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 2.546875) internal successors, (652), 256 states have internal predecessors, (652), 0 states have call successors, (0), 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:27:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 652 transitions. [2022-11-03 02:27:18,726 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 652 transitions. Word has length 26 [2022-11-03 02:27:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:27:18,730 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 652 transitions. [2022-11-03 02:27:18,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 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:27:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 652 transitions. [2022-11-03 02:27:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 02:27:18,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:27:18,731 INFO L195 NwaCegarLoop]: trace histogram [2, 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:27:18,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:27:18,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 02:27:18,955 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 1 more)] === [2022-11-03 02:27:18,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:27:18,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1880259117, now seen corresponding path program 3 times [2022-11-03 02:27:18,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:27:18,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869838554] [2022-11-03 02:27:18,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:27:18,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:27:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:27:20,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:27:20,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869838554] [2022-11-03 02:27:20,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869838554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:27:20,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399137387] [2022-11-03 02:27:20,335 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:27:20,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:27:20,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:27:20,336 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:27:20,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:27:20,451 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:27:20,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:27:20,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 02:27:20,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:27:20,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:20,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:27:20,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:20,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:27:20,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 7 [2022-11-03 02:27:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:27:21,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:27:21,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_228 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_228) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:27:21,218 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (< (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_228) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:27:21,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:27:21,236 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 190 treesize of output 178 [2022-11-03 02:27:21,248 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 162 treesize of output 150 [2022-11-03 02:27:21,253 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 150 treesize of output 126 [2022-11-03 02:27:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-03 02:27:21,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399137387] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:27:21,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1614836720] [2022-11-03 02:27:21,635 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:27:21,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:27:21,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2022-11-03 02:27:21,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118065512] [2022-11-03 02:27:21,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:27:21,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 02:27:21,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:27:21,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 02:27:21,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=931, Unknown=2, NotChecked=126, Total=1190 [2022-11-03 02:27:21,639 INFO L87 Difference]: Start difference. First operand 257 states and 652 transitions. Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 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:27:25,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:27:25,987 INFO L93 Difference]: Finished difference Result 632 states and 1539 transitions. [2022-11-03 02:27:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-03 02:27:25,988 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 02:27:25,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:27:25,990 INFO L225 Difference]: With dead ends: 632 [2022-11-03 02:27:25,990 INFO L226 Difference]: Without dead ends: 548 [2022-11-03 02:27:25,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 32 SyntacticMatches, 9 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=887, Invalid=4521, Unknown=2, NotChecked=290, Total=5700 [2022-11-03 02:27:25,992 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 565 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:27:25,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 3 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1493 Invalid, 0 Unknown, 187 Unchecked, 1.3s Time] [2022-11-03 02:27:25,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-11-03 02:27:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 210. [2022-11-03 02:27:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.5789473684210527) internal successors, (539), 209 states have internal predecessors, (539), 0 states have call successors, (0), 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:27:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 539 transitions. [2022-11-03 02:27:26,003 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 539 transitions. Word has length 26 [2022-11-03 02:27:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:27:26,007 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 539 transitions. [2022-11-03 02:27:26,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 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:27:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 539 transitions. [2022-11-03 02:27:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:27:26,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:27:26,012 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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:27:26,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:27:26,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:27:26,227 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 1 more)] === [2022-11-03 02:27:26,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:27:26,227 INFO L85 PathProgramCache]: Analyzing trace with hash 185057185, now seen corresponding path program 4 times [2022-11-03 02:27:26,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:27:26,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279296659] [2022-11-03 02:27:26,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:27:26,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:27:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:27:26,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:27:26,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279296659] [2022-11-03 02:27:26,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279296659] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:27:26,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301082034] [2022-11-03 02:27:26,473 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:27:26,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:27:26,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:27:26,474 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:27:26,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:27:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:26,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:27:26,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:27:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:27:26,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:27:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:27:26,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301082034] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:27:26,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1180305508] [2022-11-03 02:27:26,757 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:27:26,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:27:26,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 11 [2022-11-03 02:27:26,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471625826] [2022-11-03 02:27:26,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:27:26,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:27:26,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:27:26,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:27:26,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:27:26,761 INFO L87 Difference]: Start difference. First operand 210 states and 539 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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:27:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:27:27,010 INFO L93 Difference]: Finished difference Result 636 states and 1597 transitions. [2022-11-03 02:27:27,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:27:27,011 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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:27:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:27:27,014 INFO L225 Difference]: With dead ends: 636 [2022-11-03 02:27:27,014 INFO L226 Difference]: Without dead ends: 487 [2022-11-03 02:27:27,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:27:27,016 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 72 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:27:27,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 28 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:27:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-11-03 02:27:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 463. [2022-11-03 02:27:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 2.6385281385281387) internal successors, (1219), 462 states have internal predecessors, (1219), 0 states have call successors, (0), 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:27:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1219 transitions. [2022-11-03 02:27:27,035 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1219 transitions. Word has length 28 [2022-11-03 02:27:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:27:27,035 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 1219 transitions. [2022-11-03 02:27:27,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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:27:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1219 transitions. [2022-11-03 02:27:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:27:27,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:27:27,037 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:27:27,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:27:27,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-03 02:27:27,259 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 1 more)] === [2022-11-03 02:27:27,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:27:27,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1365134230, now seen corresponding path program 5 times [2022-11-03 02:27:27,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:27:27,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245321352] [2022-11-03 02:27:27,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:27:27,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:27:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:27:28,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:27:28,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245321352] [2022-11-03 02:27:28,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245321352] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:27:28,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285318288] [2022-11-03 02:27:28,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:27:28,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:27:28,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:27:28,916 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:27:28,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:27:29,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:27:29,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:27:29,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 02:27:29,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:27:29,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:29,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-03 02:27:30,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:27:30,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-03 02:27:30,347 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:27:30,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 13 [2022-11-03 02:27:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:27:30,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:27:31,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:27:31,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 271 treesize of output 272 [2022-11-03 02:27:31,376 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:27:31,377 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 212 treesize of output 186 [2022-11-03 02:27:31,391 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:27:31,392 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 186 treesize of output 134 [2022-11-03 02:27:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:27:32,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285318288] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:27:32,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [51287743] [2022-11-03 02:27:32,082 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:27:32,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:27:32,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2022-11-03 02:27:32,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103882349] [2022-11-03 02:27:32,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:27:32,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-03 02:27:32,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:27:32,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-03 02:27:32,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=2087, Unknown=4, NotChecked=0, Total=2352 [2022-11-03 02:27:32,084 INFO L87 Difference]: Start difference. First operand 463 states and 1219 transitions. Second operand has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:27:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:27:57,887 INFO L93 Difference]: Finished difference Result 2854 states and 7085 transitions. [2022-11-03 02:27:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-11-03 02:27:57,888 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:27:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:27:57,900 INFO L225 Difference]: With dead ends: 2854 [2022-11-03 02:27:57,900 INFO L226 Difference]: Without dead ends: 2674 [2022-11-03 02:27:57,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14545 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=5093, Invalid=34719, Unknown=790, NotChecked=0, Total=40602 [2022-11-03 02:27:57,909 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 930 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 3605 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 9167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 3605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5352 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:27:57,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 19 Invalid, 9167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 3605 Invalid, 0 Unknown, 5352 Unchecked, 3.1s Time] [2022-11-03 02:27:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2022-11-03 02:27:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 622. [2022-11-03 02:27:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 2.610305958132045) internal successors, (1621), 621 states have internal predecessors, (1621), 0 states have call successors, (0), 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:27:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1621 transitions. [2022-11-03 02:27:57,953 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1621 transitions. Word has length 31 [2022-11-03 02:27:57,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:27:57,953 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 1621 transitions. [2022-11-03 02:27:57,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:27:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1621 transitions. [2022-11-03 02:27:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:27:57,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:27:57,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:27:57,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:27:58,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:27:58,161 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 1 more)] === [2022-11-03 02:27:58,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:27:58,161 INFO L85 PathProgramCache]: Analyzing trace with hash -189895748, now seen corresponding path program 6 times [2022-11-03 02:27:58,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:27:58,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858248241] [2022-11-03 02:27:58,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:27:58,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:27:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:27:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:27:59,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:27:59,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858248241] [2022-11-03 02:27:59,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858248241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:27:59,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028312177] [2022-11-03 02:27:59,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:27:59,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:27:59,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:27:59,898 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:27:59,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:28:00,030 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:28:00,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:28:00,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-03 02:28:00,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:28:00,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:00,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-03 02:28:00,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:00,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:28:01,083 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:28:01,084 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 47 treesize of output 13 [2022-11-03 02:28:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:28:01,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:28:01,447 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_372 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:01,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_372 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:01,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_372 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:01,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_371)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:01,704 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:28:01,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 535 treesize of output 470 [2022-11-03 02:28:01,724 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 410 treesize of output 354 [2022-11-03 02:28:01,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:28:01,738 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 354 treesize of output 278 [2022-11-03 02:28:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-03 02:28:02,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028312177] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:28:02,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [171595475] [2022-11-03 02:28:02,354 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:28:02,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:28:02,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 49 [2022-11-03 02:28:02,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942814421] [2022-11-03 02:28:02,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:28:02,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 02:28:02,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:28:02,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 02:28:02,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1848, Unknown=4, NotChecked=364, Total=2450 [2022-11-03 02:28:02,357 INFO L87 Difference]: Start difference. First operand 622 states and 1621 transitions. Second operand has 50 states, 50 states have (on average 1.7) internal successors, (85), 49 states have internal predecessors, (85), 0 states have call successors, (0), 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:28:09,097 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_371)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1))) (<= 1 c_~v_assert~0)) is different from false [2022-11-03 02:28:09,588 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_371)) (.cse2 (* c_~front~0 4))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)) c_~d~0 (select (select .cse1 c_~queue~0.base) (+ c_~queue~0.offset .cse2)))) (+ c_~W~0 1))))) (and (<= c_~v_assert~0 1) .cse0 (<= 1 c_~v_assert~0) (or .cse0 (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))))) is different from false [2022-11-03 02:28:11,556 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_371)) (.cse2 (* c_~front~0 4))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)) c_~d~0 (select (select .cse1 c_~queue~0.base) (+ c_~queue~0.offset .cse2)))) (+ c_~W~0 1))))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) .cse0 (<= 1 c_~v_assert~0) (or .cse0 (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))))) is different from false [2022-11-03 02:28:16,729 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_371)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1))) (<= c_~d~0 c_~W~0) (<= 1 c_~v_assert~0)) is different from false [2022-11-03 02:28:17,975 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= |c_thread2Thread1of1ForFork2_~temp~0#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (forall ((v_ArrVal_371 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_371)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_372) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1))) (<= c_~d~0 1) (<= 2 c_~W~0) (<= 1 c_~v_assert~0) (= |c_thread2Thread1of1ForFork2_~temp~0#1| 1) (<= (+ c_~d~0 1) c_~W~0)) is different from false [2022-11-03 02:28:18,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:28:18,792 INFO L93 Difference]: Finished difference Result 2431 states and 6752 transitions. [2022-11-03 02:28:18,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-11-03 02:28:18,793 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 49 states have internal predecessors, (85), 0 states have call successors, (0), 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:28:18,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:28:18,804 INFO L225 Difference]: With dead ends: 2431 [2022-11-03 02:28:18,804 INFO L226 Difference]: Without dead ends: 2375 [2022-11-03 02:28:18,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 41 SyntacticMatches, 23 SemanticMatches, 160 ConstructedPredicates, 9 IntricatePredicates, 5 DeprecatedPredicates, 8411 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=3507, Invalid=19775, Unknown=10, NotChecked=2790, Total=26082 [2022-11-03 02:28:18,808 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 586 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 6006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2825 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:28:18,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 41 Invalid, 6006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 2936 Invalid, 0 Unknown, 2825 Unchecked, 2.4s Time] [2022-11-03 02:28:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2022-11-03 02:28:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 983. [2022-11-03 02:28:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 2.80142566191446) internal successors, (2751), 982 states have internal predecessors, (2751), 0 states have call successors, (0), 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:28:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 2751 transitions. [2022-11-03 02:28:18,854 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 2751 transitions. Word has length 31 [2022-11-03 02:28:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:28:18,855 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 2751 transitions. [2022-11-03 02:28:18,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 49 states have internal predecessors, (85), 0 states have call successors, (0), 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:28:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 2751 transitions. [2022-11-03 02:28:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:28:18,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:28:18,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:28:18,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:28:19,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:28:19,083 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 1 more)] === [2022-11-03 02:28:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:28:19,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2018843470, now seen corresponding path program 7 times [2022-11-03 02:28:19,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:28:19,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280798260] [2022-11-03 02:28:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:28:19,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:28:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:28:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:28:20,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:28:20,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280798260] [2022-11-03 02:28:20,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280798260] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:28:20,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747893216] [2022-11-03 02:28:20,700 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:28:20,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:28:20,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:28:20,702 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:28:20,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:28:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:28:20,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 02:28:20,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:28:21,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:21,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-03 02:28:21,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:21,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:28:22,043 INFO L356 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-11-03 02:28:22,044 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 47 treesize of output 16 [2022-11-03 02:28:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:28:22,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:28:22,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_422) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:22,363 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_422) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:22,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_422) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:22,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_421 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_421)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_422) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:22,604 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 02:28:22,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 534 treesize of output 470 [2022-11-03 02:28:22,621 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 410 treesize of output 354 [2022-11-03 02:28:22,667 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:28:22,668 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 354 treesize of output 278 [2022-11-03 02:28:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-03 02:28:23,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747893216] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:28:23,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [572670036] [2022-11-03 02:28:23,690 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:28:23,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:28:23,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2022-11-03 02:28:23,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414669276] [2022-11-03 02:28:23,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:28:23,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-03 02:28:23,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:28:23,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-03 02:28:23,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1767, Unknown=4, NotChecked=356, Total=2352 [2022-11-03 02:28:23,693 INFO L87 Difference]: Start difference. First operand 983 states and 2751 transitions. Second operand has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:28:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:28:35,426 INFO L93 Difference]: Finished difference Result 2671 states and 6878 transitions. [2022-11-03 02:28:35,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-03 02:28:35,427 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:28:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:28:35,438 INFO L225 Difference]: With dead ends: 2671 [2022-11-03 02:28:35,438 INFO L226 Difference]: Without dead ends: 2469 [2022-11-03 02:28:35,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 38 SyntacticMatches, 11 SemanticMatches, 118 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 4017 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1959, Invalid=11331, Unknown=66, NotChecked=924, Total=14280 [2022-11-03 02:28:35,440 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 520 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 4693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2533 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:28:35,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 16 Invalid, 4693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2030 Invalid, 0 Unknown, 2533 Unchecked, 1.6s Time] [2022-11-03 02:28:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2022-11-03 02:28:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 1261. [2022-11-03 02:28:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1260 states have (on average 2.772222222222222) internal successors, (3493), 1260 states have internal predecessors, (3493), 0 states have call successors, (0), 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:28:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 3493 transitions. [2022-11-03 02:28:35,493 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 3493 transitions. Word has length 31 [2022-11-03 02:28:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:28:35,493 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 3493 transitions. [2022-11-03 02:28:35,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:28:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 3493 transitions. [2022-11-03 02:28:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:28:35,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:28:35,498 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:28:35,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:28:35,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:28:35,711 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 1 more)] === [2022-11-03 02:28:35,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:28:35,711 INFO L85 PathProgramCache]: Analyzing trace with hash -129953066, now seen corresponding path program 8 times [2022-11-03 02:28:35,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:28:35,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484514458] [2022-11-03 02:28:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:28:35,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:28:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:28:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:28:37,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:28:37,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484514458] [2022-11-03 02:28:37,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484514458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:28:37,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699880093] [2022-11-03 02:28:37,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:28:37,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:28:37,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:28:37,365 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:28:37,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:28:37,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:28:37,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:28:37,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:28:37,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:28:38,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:38,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-03 02:28:38,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:38,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:28:38,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:28:38,878 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:28:38,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 16 [2022-11-03 02:28:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:28:39,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:28:39,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_472 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_472) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:39,228 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_472 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_472) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:39,239 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_472 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_472) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) (+ c_~W~0 1))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-11-03 02:28:39,250 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_472 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_472) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) (+ c_~W~0 1)))) is different from false [2022-11-03 02:28:39,273 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_472 (Array Int Int)) (v_ArrVal_471 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_471)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_472) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) (+ c_~W~0 1))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-11-03 02:28:39,545 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 02:28:39,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 534 treesize of output 470 [2022-11-03 02:28:39,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:28:39,566 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 410 treesize of output 334 [2022-11-03 02:28:39,576 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 334 treesize of output 278 [2022-11-03 02:28:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-03 02:28:40,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699880093] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:28:40,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1710547424] [2022-11-03 02:28:40,583 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:28:40,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:28:40,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2022-11-03 02:28:40,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285201272] [2022-11-03 02:28:40,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:28:40,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-03 02:28:40,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:28:40,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-03 02:28:40,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1692, Unknown=5, NotChecked=440, Total=2352 [2022-11-03 02:28:40,587 INFO L87 Difference]: Start difference. First operand 1261 states and 3493 transitions. Second operand has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:28:43,882 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (forall ((v_ArrVal_472 (Array Int Int)) (v_ArrVal_471 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_471)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_472) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) (+ c_~W~0 1))) (= (mod c_~v_assert~0 256) 0)) (<= 1 c_~v_assert~0)) is different from false [2022-11-03 02:28:45,611 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (forall ((v_ArrVal_472 (Array Int Int)) (v_ArrVal_471 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_471)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_472) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) (+ c_~W~0 1))) (= (mod c_~v_assert~0 256) 0)) (<= c_~d~0 2) (<= 2 c_~W~0) (<= 1 c_~v_assert~0)) is different from false [2022-11-03 02:28:49,243 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_472 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_472) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 02:28:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:28:51,647 INFO L93 Difference]: Finished difference Result 4195 states and 11480 transitions. [2022-11-03 02:28:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-11-03 02:28:51,647 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:28:51,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:28:51,666 INFO L225 Difference]: With dead ends: 4195 [2022-11-03 02:28:51,666 INFO L226 Difference]: Without dead ends: 4145 [2022-11-03 02:28:51,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 65 SyntacticMatches, 23 SemanticMatches, 131 ConstructedPredicates, 8 IntricatePredicates, 5 DeprecatedPredicates, 5337 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=2258, Invalid=13208, Unknown=66, NotChecked=2024, Total=17556 [2022-11-03 02:28:51,669 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 631 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 4838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3144 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:28:51,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 30 Invalid, 4838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1578 Invalid, 0 Unknown, 3144 Unchecked, 1.3s Time] [2022-11-03 02:28:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2022-11-03 02:28:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 1764. [2022-11-03 02:28:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1764 states, 1763 states have (on average 2.796937039137833) internal successors, (4931), 1763 states have internal predecessors, (4931), 0 states have call successors, (0), 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:28:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 4931 transitions. [2022-11-03 02:28:51,742 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 4931 transitions. Word has length 31 [2022-11-03 02:28:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:28:51,742 INFO L495 AbstractCegarLoop]: Abstraction has 1764 states and 4931 transitions. [2022-11-03 02:28:51,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:28:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 4931 transitions. [2022-11-03 02:28:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:28:51,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:28:51,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:28:51,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:28:51,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 02:28:51,956 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 1 more)] === [2022-11-03 02:28:51,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:28:51,956 INFO L85 PathProgramCache]: Analyzing trace with hash -687348130, now seen corresponding path program 9 times [2022-11-03 02:28:51,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:28:51,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593192174] [2022-11-03 02:28:51,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:28:51,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:28:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:28:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:28:53,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:28:53,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593192174] [2022-11-03 02:28:53,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593192174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:28:53,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443777441] [2022-11-03 02:28:53,285 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:28:53,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:28:53,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:28:53,286 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:28:53,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:28:53,424 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:28:53,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:28:53,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 02:28:53,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:28:54,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:54,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-03 02:28:54,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:28:54,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:28:54,520 INFO L356 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-11-03 02:28:54,521 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 47 treesize of output 16 [2022-11-03 02:28:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:28:54,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:28:54,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_522) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:54,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_522) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) |c_thread2Thread1of1ForFork2_~temp~0#1|) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:54,860 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_522) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:54,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_521)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_522) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:28:55,116 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 02:28:55,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 534 treesize of output 470 [2022-11-03 02:28:55,136 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 410 treesize of output 354 [2022-11-03 02:28:55,153 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:28:55,153 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 354 treesize of output 278 [2022-11-03 02:28:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 02:28:56,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443777441] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:28:56,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1948100405] [2022-11-03 02:28:56,223 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:28:56,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:28:56,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2022-11-03 02:28:56,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323612018] [2022-11-03 02:28:56,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:28:56,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-03 02:28:56,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:28:56,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-03 02:28:56,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1769, Unknown=4, NotChecked=356, Total=2352 [2022-11-03 02:28:56,225 INFO L87 Difference]: Start difference. First operand 1764 states and 4931 transitions. Second operand has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:06,044 INFO L93 Difference]: Finished difference Result 3486 states and 9731 transitions. [2022-11-03 02:29:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-03 02:29:06,044 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:29:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:06,060 INFO L225 Difference]: With dead ends: 3486 [2022-11-03 02:29:06,060 INFO L226 Difference]: Without dead ends: 3410 [2022-11-03 02:29:06,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 40 SyntacticMatches, 13 SemanticMatches, 104 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 2967 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1523, Invalid=8791, Unknown=4, NotChecked=812, Total=11130 [2022-11-03 02:29:06,062 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 390 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 2252 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 4207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1845 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:06,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 20 Invalid, 4207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2252 Invalid, 0 Unknown, 1845 Unchecked, 1.7s Time] [2022-11-03 02:29:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2022-11-03 02:29:06,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 1531. [2022-11-03 02:29:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1530 states have (on average 2.895424836601307) internal successors, (4430), 1530 states have internal predecessors, (4430), 0 states have call successors, (0), 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:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 4430 transitions. [2022-11-03 02:29:06,122 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 4430 transitions. Word has length 31 [2022-11-03 02:29:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:06,123 INFO L495 AbstractCegarLoop]: Abstraction has 1531 states and 4430 transitions. [2022-11-03 02:29:06,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 4430 transitions. [2022-11-03 02:29:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:29:06,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:06,128 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:06,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:06,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:06,355 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 1 more)] === [2022-11-03 02:29:06,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:06,355 INFO L85 PathProgramCache]: Analyzing trace with hash -656015380, now seen corresponding path program 10 times [2022-11-03 02:29:06,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:06,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644751885] [2022-11-03 02:29:06,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:06,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:29:07,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:07,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644751885] [2022-11-03 02:29:07,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644751885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:07,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854872209] [2022-11-03 02:29:07,785 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:29:07,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:07,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:07,786 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:07,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:29:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:07,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 02:29:07,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:07,978 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 16 treesize of output 12 [2022-11-03 02:29:08,031 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:29:08,101 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:29:08,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:29:08,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-03 02:29:08,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:29:08,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:29:08,856 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:29:08,857 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 47 treesize of output 13 [2022-11-03 02:29:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:29:09,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:29:09,215 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_577) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:29:09,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_577) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:29:09,243 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_577 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_576)) (.cse1 (* c_~front~0 4))) (+ (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_577) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0)) (+ c_~W~0 1))) is different from false [2022-11-03 02:29:10,043 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:29:10,043 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 2 case distinctions, treesize of input 150 treesize of output 95 [2022-11-03 02:29:10,077 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:29:10,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3864 treesize of output 3499 [2022-11-03 02:29:10,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3398 treesize of output 2790 [2022-11-03 02:29:10,140 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 2790 treesize of output 2342 [2022-11-03 02:29:10,193 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:29:10,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2391 treesize of output 2126 [2022-11-03 02:29:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-03 02:29:11,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854872209] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:29:11,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1830348486] [2022-11-03 02:29:11,806 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:11,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:29:11,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 49 [2022-11-03 02:29:11,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496633323] [2022-11-03 02:29:11,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:29:11,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 02:29:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:11,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 02:29:11,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1912, Unknown=8, NotChecked=276, Total=2450 [2022-11-03 02:29:11,809 INFO L87 Difference]: Start difference. First operand 1531 states and 4430 transitions. Second operand has 50 states, 50 states have (on average 1.7) internal successors, (85), 49 states have internal predecessors, (85), 0 states have call successors, (0), 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:14,807 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_577 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_576)) (.cse2 (* c_~front~0 4))) (+ (select (select .cse1 c_~queue~0.base) (+ c_~queue~0.offset .cse2)) (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_577) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)) c_~d~0)) (+ c_~W~0 1))))) (and (or (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) .cse0 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) .cse0)) is different from false [2022-11-03 02:29:19,776 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_577 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_577) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 02:29:24,413 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_577 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_576)) (.cse2 (* c_~front~0 4))) (+ (select (select .cse1 c_~queue~0.base) (+ c_~queue~0.offset .cse2)) (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_577) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)) c_~d~0)) (+ c_~W~0 1))))) (and (<= c_~d~0 2) (<= 2 c_~W~0) (or (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) .cse0 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) .cse0)) is different from false [2022-11-03 02:29:32,579 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_577 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_576)) (.cse2 (* c_~front~0 4))) (+ (select (select .cse1 c_~queue~0.base) (+ c_~queue~0.offset .cse2)) (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_577) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)) c_~d~0)) (+ c_~W~0 1))))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) .cse0 (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) (<= 1 c_~v_assert~0) .cse0)) is different from false [2022-11-03 02:29:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:34,575 INFO L93 Difference]: Finished difference Result 6318 states and 19144 transitions. [2022-11-03 02:29:34,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2022-11-03 02:29:34,576 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 49 states have internal predecessors, (85), 0 states have call successors, (0), 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:29:34,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:34,604 INFO L225 Difference]: With dead ends: 6318 [2022-11-03 02:29:34,604 INFO L226 Difference]: Without dead ends: 6206 [2022-11-03 02:29:34,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 73 SyntacticMatches, 54 SemanticMatches, 205 ConstructedPredicates, 7 IntricatePredicates, 11 DeprecatedPredicates, 17489 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=5724, Invalid=34063, Unknown=41, NotChecked=2814, Total=42642 [2022-11-03 02:29:34,608 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 785 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 3527 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 7155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 3527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3315 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:34,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 58 Invalid, 7155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 3527 Invalid, 0 Unknown, 3315 Unchecked, 2.9s Time] [2022-11-03 02:29:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states. [2022-11-03 02:29:34,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 2296. [2022-11-03 02:29:34,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2296 states, 2295 states have (on average 3.010021786492375) internal successors, (6908), 2295 states have internal predecessors, (6908), 0 states have call successors, (0), 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:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 6908 transitions. [2022-11-03 02:29:34,713 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 6908 transitions. Word has length 31 [2022-11-03 02:29:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:34,713 INFO L495 AbstractCegarLoop]: Abstraction has 2296 states and 6908 transitions. [2022-11-03 02:29:34,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 49 states have internal predecessors, (85), 0 states have call successors, (0), 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:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 6908 transitions. [2022-11-03 02:29:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:29:34,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:34,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:34,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-03 02:29:34,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 02:29:34,935 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 1 more)] === [2022-11-03 02:29:34,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:34,935 INFO L85 PathProgramCache]: Analyzing trace with hash 220184556, now seen corresponding path program 11 times [2022-11-03 02:29:34,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:34,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944356037] [2022-11-03 02:29:34,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:34,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:29:36,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:36,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944356037] [2022-11-03 02:29:36,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944356037] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:36,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108371028] [2022-11-03 02:29:36,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:29:36,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:36,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:36,449 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:36,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:29:36,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:29:36,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:29:36,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:29:36,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:37,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:29:37,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-03 02:29:37,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:29:37,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:29:37,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:29:37,502 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 47 treesize of output 13 [2022-11-03 02:29:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:29:37,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:29:37,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_627 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1|) (+ c_~W~0 1))) is different from false [2022-11-03 02:29:37,836 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_627 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) (+ c_~W~0 1))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-11-03 02:29:37,846 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_627 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) (+ c_~W~0 1))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-11-03 02:29:37,869 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_626 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_626)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1)))) is different from false [2022-11-03 02:29:38,052 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:29:38,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 535 treesize of output 470 [2022-11-03 02:29:38,068 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 410 treesize of output 354 [2022-11-03 02:29:38,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:29:38,081 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 354 treesize of output 278 [2022-11-03 02:29:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-11-03 02:29:38,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108371028] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:29:38,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1311660617] [2022-11-03 02:29:38,424 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:38,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:29:38,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 46 [2022-11-03 02:29:38,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539466130] [2022-11-03 02:29:38,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:29:38,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 02:29:38,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:38,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 02:29:38,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1619, Unknown=5, NotChecked=340, Total=2162 [2022-11-03 02:29:38,427 INFO L87 Difference]: Start difference. First operand 2296 states and 6908 transitions. Second operand has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:44,734 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_627 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_627) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1|) (+ c_~W~0 1))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 02:29:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:48,995 INFO L93 Difference]: Finished difference Result 6098 states and 18334 transitions. [2022-11-03 02:29:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-11-03 02:29:48,995 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:29:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:49,016 INFO L225 Difference]: With dead ends: 6098 [2022-11-03 02:29:49,017 INFO L226 Difference]: Without dead ends: 6098 [2022-11-03 02:29:49,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 52 SyntacticMatches, 18 SemanticMatches, 145 ConstructedPredicates, 5 IntricatePredicates, 5 DeprecatedPredicates, 6977 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2876, Invalid=17150, Unknown=16, NotChecked=1420, Total=21462 [2022-11-03 02:29:49,019 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 782 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 3151 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 5603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 3151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2082 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:49,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 19 Invalid, 5603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 3151 Invalid, 0 Unknown, 2082 Unchecked, 2.5s Time] [2022-11-03 02:29:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6098 states. [2022-11-03 02:29:49,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6098 to 2739. [2022-11-03 02:29:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2739 states, 2738 states have (on average 3.014974433893353) internal successors, (8255), 2738 states have internal predecessors, (8255), 0 states have call successors, (0), 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:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2739 states and 8255 transitions. [2022-11-03 02:29:49,130 INFO L78 Accepts]: Start accepts. Automaton has 2739 states and 8255 transitions. Word has length 31 [2022-11-03 02:29:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:49,130 INFO L495 AbstractCegarLoop]: Abstraction has 2739 states and 8255 transitions. [2022-11-03 02:29:49,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 8255 transitions. [2022-11-03 02:29:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:29:49,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:49,139 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:49,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:49,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 02:29:49,355 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:29:49,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:49,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2055551386, now seen corresponding path program 12 times [2022-11-03 02:29:49,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:49,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560492549] [2022-11-03 02:29:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:49,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:29:50,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:50,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560492549] [2022-11-03 02:29:50,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560492549] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:50,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082392847] [2022-11-03 02:29:50,792 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:29:50,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:50,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:50,793 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:50,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:29:50,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:29:50,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:29:50,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:29:50,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:51,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:29:51,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-03 02:29:51,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:29:51,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:29:51,635 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:29:51,635 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 47 treesize of output 13 [2022-11-03 02:29:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:29:51,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:29:51,955 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_677) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:29:51,963 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_677) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:29:51,978 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_676)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_677) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:29:52,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:29:52,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 275 treesize of output 260 [2022-11-03 02:29:52,148 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 200 treesize of output 172 [2022-11-03 02:29:52,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:29:52,159 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 172 treesize of output 134 [2022-11-03 02:29:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-11-03 02:29:52,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082392847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:29:52,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [677007086] [2022-11-03 02:29:52,569 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:52,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:29:52,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 46 [2022-11-03 02:29:52,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571292470] [2022-11-03 02:29:52,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:29:52,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 02:29:52,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:52,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 02:29:52,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1713, Unknown=3, NotChecked=258, Total=2162 [2022-11-03 02:29:52,572 INFO L87 Difference]: Start difference. First operand 2739 states and 8255 transitions. Second operand has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:58,941 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_677 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_677) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 02:30:00,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:30:00,776 INFO L93 Difference]: Finished difference Result 5591 states and 16878 transitions. [2022-11-03 02:30:00,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-11-03 02:30:00,777 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:30:00,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:30:00,795 INFO L225 Difference]: With dead ends: 5591 [2022-11-03 02:30:00,795 INFO L226 Difference]: Without dead ends: 5519 [2022-11-03 02:30:00,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 115 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 3801 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1566, Invalid=11102, Unknown=4, NotChecked=900, Total=13572 [2022-11-03 02:30:00,797 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 665 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 3447 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 3447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1331 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:30:00,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 27 Invalid, 5009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 3447 Invalid, 0 Unknown, 1331 Unchecked, 2.6s Time] [2022-11-03 02:30:00,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2022-11-03 02:30:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 2732. [2022-11-03 02:30:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2732 states, 2731 states have (on average 3.0541926034419626) internal successors, (8341), 2731 states have internal predecessors, (8341), 0 states have call successors, (0), 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:30:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 8341 transitions. [2022-11-03 02:30:00,896 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 8341 transitions. Word has length 31 [2022-11-03 02:30:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:30:00,896 INFO L495 AbstractCegarLoop]: Abstraction has 2732 states and 8341 transitions. [2022-11-03 02:30:00,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:30:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 8341 transitions. [2022-11-03 02:30:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:30:00,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:30:00,903 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:30:00,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:30:01,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 02:30:01,119 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:30:01,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:30:01,119 INFO L85 PathProgramCache]: Analyzing trace with hash -268490624, now seen corresponding path program 13 times [2022-11-03 02:30:01,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:30:01,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725120202] [2022-11-03 02:30:01,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:30:01,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:30:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:30:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:30:02,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:30:02,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725120202] [2022-11-03 02:30:02,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725120202] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:30:02,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445636361] [2022-11-03 02:30:02,510 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:30:02,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:30:02,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:30:02,511 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:30:02,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 02:30:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:30:02,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-03 02:30:02,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:30:02,766 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 13 treesize of output 9 [2022-11-03 02:30:02,826 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:03,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:30:03,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-03 02:30:03,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:30:03,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:30:03,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:30:03,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 13 [2022-11-03 02:30:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:30:03,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:30:03,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:30:03,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:30:04,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:30:04,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:30:04,618 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:30:04,619 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 118 treesize of output 82 [2022-11-03 02:30:04,651 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:30:04,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3864 treesize of output 3499 [2022-11-03 02:30:04,674 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 3398 treesize of output 2950 [2022-11-03 02:30:04,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2950 treesize of output 2342 [2022-11-03 02:30:04,745 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:30:04,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2391 treesize of output 2126 [2022-11-03 02:32:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-03 02:32:44,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445636361] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:32:44,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1110882666] [2022-11-03 02:32:44,712 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:32:44,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:32:44,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2022-11-03 02:32:44,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836926198] [2022-11-03 02:32:44,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:32:44,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-03 02:32:44,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:32:44,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-03 02:32:44,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1743, Unknown=7, NotChecked=356, Total=2352 [2022-11-03 02:32:44,714 INFO L87 Difference]: Start difference. First operand 2732 states and 8341 transitions. Second operand has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:32:47,372 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729)) (.cse2 (* c_~front~0 4))) (+ c_~d~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~queue~0.base) (+ c_~queue~0.offset .cse2 4)) (select (select .cse1 c_~queue~0.base) (+ c_~queue~0.offset .cse2)))) (+ c_~W~0 1))))) (and .cse0 (or .cse0 (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))))) is different from false [2022-11-03 02:32:49,480 WARN L833 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (forall ((v_ArrVal_730 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1)))) is different from false [2022-11-03 02:32:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:32:53,115 INFO L93 Difference]: Finished difference Result 5014 states and 15438 transitions. [2022-11-03 02:32:53,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-03 02:32:53,116 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:32:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:32:53,128 INFO L225 Difference]: With dead ends: 5014 [2022-11-03 02:32:53,128 INFO L226 Difference]: Without dead ends: 4958 [2022-11-03 02:32:53,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 39 SyntacticMatches, 16 SemanticMatches, 110 ConstructedPredicates, 6 IntricatePredicates, 3 DeprecatedPredicates, 3642 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1763, Invalid=9377, Unknown=14, NotChecked=1278, Total=12432 [2022-11-03 02:32:53,131 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 665 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 4400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1985 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:32:53,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 35 Invalid, 4400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 2168 Invalid, 0 Unknown, 1985 Unchecked, 1.8s Time] [2022-11-03 02:32:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2022-11-03 02:32:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 3200. [2022-11-03 02:32:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3200 states, 3199 states have (on average 3.0894029384182558) internal successors, (9883), 3199 states have internal predecessors, (9883), 0 states have call successors, (0), 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:32:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 9883 transitions. [2022-11-03 02:32:53,245 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 9883 transitions. Word has length 31 [2022-11-03 02:32:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:32:53,245 INFO L495 AbstractCegarLoop]: Abstraction has 3200 states and 9883 transitions. [2022-11-03 02:32:53,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 48 states have internal predecessors, (85), 0 states have call successors, (0), 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:32:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 9883 transitions. [2022-11-03 02:32:53,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:32:53,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:53,253 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:53,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:32:53,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:32:53,477 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:32:53,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:53,478 INFO L85 PathProgramCache]: Analyzing trace with hash 786372072, now seen corresponding path program 14 times [2022-11-03 02:32:53,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:53,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465856575] [2022-11-03 02:32:53,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:53,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:32:55,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:32:55,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465856575] [2022-11-03 02:32:55,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465856575] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:32:55,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17324354] [2022-11-03 02:32:55,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:32:55,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:32:55,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:32:55,280 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:32:55,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 02:32:55,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:32:55,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:32:55,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-03 02:32:55,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:32:55,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:55,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-03 02:32:56,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:56,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-11-03 02:32:56,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:56,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:32:56,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:32:56,688 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:32:56,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 16 [2022-11-03 02:32:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:32:56,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:32:57,658 INFO L356 Elim1Store]: treesize reduction 36, result has 50.7 percent of original size [2022-11-03 02:32:57,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 266 treesize of output 238 [2022-11-03 02:32:57,670 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 194 treesize of output 170 [2022-11-03 02:32:57,684 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 02:32:57,684 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 170 treesize of output 134 [2022-11-03 02:32:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:32:58,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17324354] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:32:58,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1189556434] [2022-11-03 02:32:58,380 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:32:58,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:32:58,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2022-11-03 02:32:58,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388789610] [2022-11-03 02:32:58,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:32:58,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 02:32:58,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:32:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 02:32:58,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1872, Unknown=2, NotChecked=0, Total=2162 [2022-11-03 02:32:58,384 INFO L87 Difference]: Start difference. First operand 3200 states and 9883 transitions. Second operand has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:33:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:17,013 INFO L93 Difference]: Finished difference Result 6672 states and 20331 transitions. [2022-11-03 02:33:17,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-11-03 02:33:17,014 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:33:17,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:17,026 INFO L225 Difference]: With dead ends: 6672 [2022-11-03 02:33:17,026 INFO L226 Difference]: Without dead ends: 6652 [2022-11-03 02:33:17,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 43 SyntacticMatches, 20 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 5196 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=2045, Invalid=12656, Unknown=61, NotChecked=0, Total=14762 [2022-11-03 02:33:17,027 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 389 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 4572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2636 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:17,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 31 Invalid, 4572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1871 Invalid, 0 Unknown, 2636 Unchecked, 1.6s Time] [2022-11-03 02:33:17,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2022-11-03 02:33:17,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 3475. [2022-11-03 02:33:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3475 states, 3474 states have (on average 3.1004605641911342) internal successors, (10771), 3474 states have internal predecessors, (10771), 0 states have call successors, (0), 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:33:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 3475 states and 10771 transitions. [2022-11-03 02:33:17,131 INFO L78 Accepts]: Start accepts. Automaton has 3475 states and 10771 transitions. Word has length 31 [2022-11-03 02:33:17,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:17,131 INFO L495 AbstractCegarLoop]: Abstraction has 3475 states and 10771 transitions. [2022-11-03 02:33:17,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:33:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3475 states and 10771 transitions. [2022-11-03 02:33:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:33:17,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:17,141 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:17,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:33:17,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 02:33:17,367 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:33:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:17,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1425025334, now seen corresponding path program 15 times [2022-11-03 02:33:17,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:17,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70242527] [2022-11-03 02:33:17,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:17,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:33:18,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:18,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70242527] [2022-11-03 02:33:18,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70242527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:18,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074712763] [2022-11-03 02:33:18,757 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:33:18,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:18,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:33:18,759 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:33:18,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 02:33:18,888 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:33:18,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:33:18,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:33:18,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:33:19,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:19,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-03 02:33:19,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:19,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:33:19,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:33:19,645 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 47 treesize of output 13 [2022-11-03 02:33:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:33:19,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:33:19,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_830) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:33:19,942 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_830) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:33:19,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_830) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)) c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:33:19,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_829)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_830) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:33:20,129 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:33:20,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 275 treesize of output 260 [2022-11-03 02:33:20,137 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 200 treesize of output 172 [2022-11-03 02:33:20,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:33:20,148 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 172 treesize of output 134 [2022-11-03 02:33:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-11-03 02:33:20,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074712763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:33:20,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1243589496] [2022-11-03 02:33:20,571 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:33:20,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:33:20,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 45 [2022-11-03 02:33:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074811941] [2022-11-03 02:33:20,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:33:20,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-03 02:33:20,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:20,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-03 02:33:20,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1562, Unknown=4, NotChecked=332, Total=2070 [2022-11-03 02:33:20,573 INFO L87 Difference]: Start difference. First operand 3475 states and 10771 transitions. Second operand has 46 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 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:33:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:34,352 INFO L93 Difference]: Finished difference Result 7821 states and 22765 transitions. [2022-11-03 02:33:34,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-11-03 02:33:34,353 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 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:33:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:34,367 INFO L225 Difference]: With dead ends: 7821 [2022-11-03 02:33:34,367 INFO L226 Difference]: Without dead ends: 7448 [2022-11-03 02:33:34,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 67 SyntacticMatches, 10 SemanticMatches, 156 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 7706 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=2868, Invalid=20706, Unknown=4, NotChecked=1228, Total=24806 [2022-11-03 02:33:34,368 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 684 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 3817 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 5846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 3817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1793 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:34,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 3 Invalid, 5846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 3817 Invalid, 0 Unknown, 1793 Unchecked, 3.2s Time] [2022-11-03 02:33:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7448 states. [2022-11-03 02:33:34,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7448 to 2628. [2022-11-03 02:33:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2627 states have (on average 3.055957365816521) internal successors, (8028), 2627 states have internal predecessors, (8028), 0 states have call successors, (0), 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:33:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 8028 transitions. [2022-11-03 02:33:34,463 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 8028 transitions. Word has length 31 [2022-11-03 02:33:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:34,464 INFO L495 AbstractCegarLoop]: Abstraction has 2628 states and 8028 transitions. [2022-11-03 02:33:34,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 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:33:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 8028 transitions. [2022-11-03 02:33:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:33:34,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:34,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:34,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:33:34,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:34,699 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:33:34,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:34,699 INFO L85 PathProgramCache]: Analyzing trace with hash 253809096, now seen corresponding path program 16 times [2022-11-03 02:33:34,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:34,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539238879] [2022-11-03 02:33:34,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:34,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:33:36,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:36,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539238879] [2022-11-03 02:33:36,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539238879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:36,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793637877] [2022-11-03 02:33:36,113 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:33:36,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:36,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:33:36,114 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:33:36,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 02:33:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:36,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:33:36,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:33:36,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:36,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-03 02:33:36,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:36,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:33:36,984 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:33:36,984 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 47 treesize of output 13 [2022-11-03 02:33:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:33:37,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:33:37,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_880) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:33:37,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_880) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:33:37,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_879)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_880) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:33:37,507 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:33:37,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 535 treesize of output 470 [2022-11-03 02:33:37,522 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:33:37,523 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 410 treesize of output 334 [2022-11-03 02:33:37,533 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 334 treesize of output 278 [2022-11-03 02:33:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-11-03 02:33:37,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793637877] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:33:37,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2046825224] [2022-11-03 02:33:37,942 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:33:37,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:33:37,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 46 [2022-11-03 02:33:37,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603497629] [2022-11-03 02:33:37,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:33:37,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 02:33:37,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:33:37,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 02:33:37,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1712, Unknown=3, NotChecked=258, Total=2162 [2022-11-03 02:33:37,945 INFO L87 Difference]: Start difference. First operand 2628 states and 8028 transitions. Second operand has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:33:43,110 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_879)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_880) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1))) (<= c_~v_assert~0 1) (<= c_~d~0 c_~W~0) (<= 1 c_~v_assert~0)) is different from false [2022-11-03 02:33:50,302 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_879)) (.cse1 (* c_~front~0 4))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_880) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1))) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= c_~d~0 c_~W~0) (<= 1 c_~v_assert~0)) is different from false [2022-11-03 02:33:51,906 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_880 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_880) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 02:33:54,658 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~front~0 4))) (let ((.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse6))) (let ((.cse3 (+ c_~W~0 1)) (.cse1 (+ c_~queue~0.offset .cse6 4)) (.cse4 (select .cse5 .cse2))) (and (forall ((v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_879))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_880) c_~queue~0.base) .cse1) c_~d~0 (select (select .cse0 c_~queue~0.base) .cse2))) .cse3)) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= |c_thread2Thread1of1ForFork2_~temp~0#1| 1) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| .cse4) .cse3) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (+ c_~queue~0.base 2) |c_ULTIMATE.start_main_~#t3~0#1.base|) (= (select .cse5 .cse1) 1) (<= c_~d~0 1) (<= 2 c_~W~0) (<= c_~d~0 0) (<= 1 c_~v_assert~0) (= .cse4 1) (= |c_thread2Thread1of1ForFork2_~temp~0#1| 1) (<= (+ c_~d~0 1) c_~W~0))))) is different from false [2022-11-03 02:33:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:33:56,083 INFO L93 Difference]: Finished difference Result 8102 states and 24542 transitions. [2022-11-03 02:33:56,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-11-03 02:33:56,083 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:33:56,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:33:56,099 INFO L225 Difference]: With dead ends: 8102 [2022-11-03 02:33:56,099 INFO L226 Difference]: Without dead ends: 8000 [2022-11-03 02:33:56,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 47 SyntacticMatches, 22 SemanticMatches, 179 ConstructedPredicates, 7 IntricatePredicates, 7 DeprecatedPredicates, 11071 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=4096, Invalid=26027, Unknown=7, NotChecked=2450, Total=32580 [2022-11-03 02:33:56,101 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 758 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 4320 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 6740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 4320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2147 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:33:56,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 27 Invalid, 6740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 4320 Invalid, 0 Unknown, 2147 Unchecked, 3.5s Time] [2022-11-03 02:33:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8000 states. [2022-11-03 02:33:56,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8000 to 2918. [2022-11-03 02:33:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 2917 states have (on average 3.07404868015084) internal successors, (8967), 2917 states have internal predecessors, (8967), 0 states have call successors, (0), 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:33:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 8967 transitions. [2022-11-03 02:33:56,215 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 8967 transitions. Word has length 31 [2022-11-03 02:33:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:33:56,215 INFO L495 AbstractCegarLoop]: Abstraction has 2918 states and 8967 transitions. [2022-11-03 02:33:56,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:33:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 8967 transitions. [2022-11-03 02:33:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:33:56,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:33:56,223 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:33:56,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 02:33:56,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:56,439 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:33:56,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:33:56,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1648989572, now seen corresponding path program 17 times [2022-11-03 02:33:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:33:56,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234356454] [2022-11-03 02:33:56,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:33:56,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:33:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:33:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:33:57,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:33:57,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234356454] [2022-11-03 02:33:57,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234356454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:33:57,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202791739] [2022-11-03 02:33:57,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:33:57,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:33:57,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:33:57,768 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:33:57,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 02:33:58,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:33:58,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:33:58,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:33:58,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:33:58,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:58,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-03 02:33:58,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:58,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:33:59,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:33:59,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:33:59,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:33:59,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 16 [2022-11-03 02:33:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:33:59,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:34:00,216 INFO L356 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2022-11-03 02:34:00,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 274 treesize of output 248 [2022-11-03 02:34:00,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:34:00,230 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 200 treesize of output 162 [2022-11-03 02:34:00,238 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 162 treesize of output 134 [2022-11-03 02:34:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:34:01,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202791739] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:34:01,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [257346909] [2022-11-03 02:34:01,004 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:34:01,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:34:01,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-11-03 02:34:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533164299] [2022-11-03 02:34:01,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:34:01,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-03 02:34:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:01,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-03 02:34:01,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=2005, Unknown=6, NotChecked=0, Total=2256 [2022-11-03 02:34:01,005 INFO L87 Difference]: Start difference. First operand 2918 states and 8967 transitions. Second operand has 48 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 47 states have internal predecessors, (85), 0 states have call successors, (0), 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:34:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:18,809 INFO L93 Difference]: Finished difference Result 5241 states and 15247 transitions. [2022-11-03 02:34:18,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-03 02:34:18,809 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 47 states have internal predecessors, (85), 0 states have call successors, (0), 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:34:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:18,817 INFO L225 Difference]: With dead ends: 5241 [2022-11-03 02:34:18,817 INFO L226 Difference]: Without dead ends: 4563 [2022-11-03 02:34:18,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 49 SyntacticMatches, 11 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5317 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=3074, Invalid=14955, Unknown=61, NotChecked=0, Total=18090 [2022-11-03 02:34:18,819 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 689 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 4813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2427 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:18,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 34 Invalid, 4813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2113 Invalid, 0 Unknown, 2427 Unchecked, 2.0s Time] [2022-11-03 02:34:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4563 states. [2022-11-03 02:34:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4563 to 2804. [2022-11-03 02:34:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2804 states, 2803 states have (on average 2.980378166250446) internal successors, (8354), 2803 states have internal predecessors, (8354), 0 states have call successors, (0), 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:34:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 8354 transitions. [2022-11-03 02:34:18,900 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 8354 transitions. Word has length 31 [2022-11-03 02:34:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:18,900 INFO L495 AbstractCegarLoop]: Abstraction has 2804 states and 8354 transitions. [2022-11-03 02:34:18,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 47 states have internal predecessors, (85), 0 states have call successors, (0), 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:34:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 8354 transitions. [2022-11-03 02:34:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:34:18,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:18,906 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:18,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 02:34:19,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-03 02:34:19,107 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:34:19,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:19,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1320979040, now seen corresponding path program 18 times [2022-11-03 02:34:19,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:19,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669366] [2022-11-03 02:34:19,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:19,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:34:20,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:20,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669366] [2022-11-03 02:34:20,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:34:20,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686359473] [2022-11-03 02:34:20,571 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:34:20,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:34:20,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:34:20,573 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:34:20,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 02:34:20,715 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:34:20,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:34:20,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 02:34:20,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:34:21,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:21,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-03 02:34:21,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:21,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:34:21,735 INFO L356 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-11-03 02:34:21,735 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 47 treesize of output 16 [2022-11-03 02:34:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:34:21,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:34:22,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_980 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_980) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:34:22,092 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_980 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_980) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:34:22,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_979)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_980) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:34:22,316 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 02:34:22,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 534 treesize of output 470 [2022-11-03 02:34:22,335 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:34:22,335 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 410 treesize of output 334 [2022-11-03 02:34:22,346 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 334 treesize of output 278 [2022-11-03 02:34:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 02:34:23,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686359473] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:34:23,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2086794239] [2022-11-03 02:34:23,376 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:34:23,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:34:23,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2022-11-03 02:34:23,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367639159] [2022-11-03 02:34:23,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:34:23,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-03 02:34:23,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:23,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-03 02:34:23,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1847, Unknown=3, NotChecked=270, Total=2352 [2022-11-03 02:34:23,379 INFO L87 Difference]: Start difference. First operand 2804 states and 8354 transitions. Second operand has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 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:34:27,188 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4))) (and (or (let ((.cse0 (< c_~n~0 (+ c_~back~0 2)))) (and (or (and (< c_~d~0 1) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse0) (or .cse0 (= .cse1 (* c_~back~0 4))) (or (< c_~n~0 (+ 3 c_~front~0)) .cse0))) (= (mod c_~v_assert~0 256) 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 c_~back~0))) (<= c_~v_assert~0 1) (<= c_~d~0 c_~W~0) (<= 1 c_~v_assert~0) (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_979))) (+ c_~d~0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_980) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select .cse2 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1))))) is different from false [2022-11-03 02:34:28,608 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_979)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_980) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1)))) is different from false [2022-11-03 02:34:28,951 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4))) (and (or (let ((.cse0 (< c_~n~0 (+ c_~back~0 2)))) (and (or (and (< c_~d~0 1) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|)) .cse0) (or .cse0 (= .cse1 (* c_~back~0 4))) (or (< c_~n~0 (+ 3 c_~front~0)) .cse0))) (= (mod c_~v_assert~0 256) 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 c_~back~0))) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= c_~d~0 c_~W~0) (<= 1 c_~v_assert~0) (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (< (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_979))) (+ c_~d~0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_980) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select .cse2 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1))))) is different from false [2022-11-03 02:34:31,010 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_979)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_980) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)) (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)))) (+ c_~W~0 1)))) is different from false [2022-11-03 02:34:32,376 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_980 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_980) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 02:34:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:34,473 INFO L93 Difference]: Finished difference Result 5014 states and 14592 transitions. [2022-11-03 02:34:34,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-11-03 02:34:34,473 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 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:34:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:34,505 INFO L225 Difference]: With dead ends: 5014 [2022-11-03 02:34:34,505 INFO L226 Difference]: Without dead ends: 4946 [2022-11-03 02:34:34,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 123 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3639 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1979, Invalid=11584, Unknown=41, NotChecked=1896, Total=15500 [2022-11-03 02:34:34,506 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 320 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 4241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1923 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:34,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 24 Invalid, 4241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2236 Invalid, 0 Unknown, 1923 Unchecked, 1.7s Time] [2022-11-03 02:34:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2022-11-03 02:34:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 2887. [2022-11-03 02:34:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 2886 states have (on average 2.994109494109494) internal successors, (8641), 2886 states have internal predecessors, (8641), 0 states have call successors, (0), 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:34:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 8641 transitions. [2022-11-03 02:34:34,578 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 8641 transitions. Word has length 31 [2022-11-03 02:34:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:34,578 INFO L495 AbstractCegarLoop]: Abstraction has 2887 states and 8641 transitions. [2022-11-03 02:34:34,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 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:34:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 8641 transitions. [2022-11-03 02:34:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:34:34,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:34,586 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:34,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 02:34:34,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-03 02:34:34,811 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:34:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1851870506, now seen corresponding path program 19 times [2022-11-03 02:34:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:34,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961578786] [2022-11-03 02:34:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:34:36,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:36,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961578786] [2022-11-03 02:34:36,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961578786] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:34:36,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886406993] [2022-11-03 02:34:36,121 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:34:36,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:34:36,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:34:36,122 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:34:36,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 02:34:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:36,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 02:34:36,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:34:36,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:36,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-03 02:34:37,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:37,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:34:37,402 INFO L356 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-11-03 02:34:37,402 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 47 treesize of output 16 [2022-11-03 02:34:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:34:37,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:34:37,758 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1030) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:34:37,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 (Array Int Int))) (< (let ((.cse0 (* c_~front~0 4))) (+ c_~d~0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1030) c_~queue~0.base) (+ c_~queue~0.offset .cse0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:34:37,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1029)) (.cse1 (* c_~front~0 4))) (+ c_~d~0 (select (select .cse0 c_~queue~0.base) (+ c_~queue~0.offset .cse1)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1030) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:34:38,003 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 02:34:38,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 534 treesize of output 470 [2022-11-03 02:34:38,021 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:34:38,022 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 410 treesize of output 334 [2022-11-03 02:34:38,033 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 334 treesize of output 278 [2022-11-03 02:34:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 02:34:39,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886406993] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:34:39,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [7946133] [2022-11-03 02:34:39,181 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:34:39,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:34:39,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 49 [2022-11-03 02:34:39,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487924400] [2022-11-03 02:34:39,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:34:39,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 02:34:39,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:39,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 02:34:39,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1930, Unknown=3, NotChecked=276, Total=2450 [2022-11-03 02:34:39,183 INFO L87 Difference]: Start difference. First operand 2887 states and 8641 transitions. Second operand has 50 states, 50 states have (on average 1.64) internal successors, (82), 49 states have internal predecessors, (82), 0 states have call successors, (0), 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:34:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:47,012 INFO L93 Difference]: Finished difference Result 4192 states and 12337 transitions. [2022-11-03 02:34:47,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-03 02:34:47,012 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.64) internal successors, (82), 49 states have internal predecessors, (82), 0 states have call successors, (0), 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:34:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:47,019 INFO L225 Difference]: With dead ends: 4192 [2022-11-03 02:34:47,019 INFO L226 Difference]: Without dead ends: 4093 [2022-11-03 02:34:47,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 31 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=997, Invalid=5492, Unknown=3, NotChecked=480, Total=6972 [2022-11-03 02:34:47,020 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 323 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1108 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:47,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 20 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1364 Invalid, 0 Unknown, 1108 Unchecked, 1.1s Time] [2022-11-03 02:34:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2022-11-03 02:34:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 2906. [2022-11-03 02:34:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2905 states have (on average 2.9972461273666093) internal successors, (8707), 2905 states have internal predecessors, (8707), 0 states have call successors, (0), 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:34:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 8707 transitions. [2022-11-03 02:34:47,088 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 8707 transitions. Word has length 31 [2022-11-03 02:34:47,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:47,088 INFO L495 AbstractCegarLoop]: Abstraction has 2906 states and 8707 transitions. [2022-11-03 02:34:47,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.64) internal successors, (82), 49 states have internal predecessors, (82), 0 states have call successors, (0), 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:34:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 8707 transitions. [2022-11-03 02:34:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:34:47,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:47,095 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:47,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 02:34:47,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-03 02:34:47,311 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:34:47,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:47,311 INFO L85 PathProgramCache]: Analyzing trace with hash 400133044, now seen corresponding path program 20 times [2022-11-03 02:34:47,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:47,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275204456] [2022-11-03 02:34:47,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:47,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:34:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:34:48,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:34:48,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275204456] [2022-11-03 02:34:48,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275204456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:34:48,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588169362] [2022-11-03 02:34:48,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:34:48,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:34:48,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:34:48,691 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:34:48,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 02:34:49,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:34:49,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:34:49,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:34:49,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:34:49,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:49,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-03 02:34:49,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:49,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:34:50,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:34:50,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:34:50,237 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:34:50,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 16 [2022-11-03 02:34:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:34:50,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:34:51,164 INFO L356 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2022-11-03 02:34:51,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 274 treesize of output 248 [2022-11-03 02:34:51,177 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 200 treesize of output 172 [2022-11-03 02:34:51,188 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:34:51,189 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 172 treesize of output 134 [2022-11-03 02:34:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:34:51,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588169362] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:34:51,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1581713353] [2022-11-03 02:34:51,882 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:34:51,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:34:51,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-11-03 02:34:51,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760315003] [2022-11-03 02:34:51,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:34:51,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-03 02:34:51,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:34:51,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-03 02:34:51,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1978, Unknown=3, NotChecked=0, Total=2256 [2022-11-03 02:34:51,886 INFO L87 Difference]: Start difference. First operand 2906 states and 8707 transitions. Second operand has 48 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 47 states have internal predecessors, (82), 0 states have call successors, (0), 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:34:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:34:59,246 INFO L93 Difference]: Finished difference Result 4026 states and 11863 transitions. [2022-11-03 02:34:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-03 02:34:59,246 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 47 states have internal predecessors, (82), 0 states have call successors, (0), 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:34:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:34:59,253 INFO L225 Difference]: With dead ends: 4026 [2022-11-03 02:34:59,253 INFO L226 Difference]: Without dead ends: 4019 [2022-11-03 02:34:59,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2687 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1339, Invalid=8714, Unknown=47, NotChecked=0, Total=10100 [2022-11-03 02:34:59,254 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 471 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1870 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:34:59,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 83 Invalid, 3431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1494 Invalid, 0 Unknown, 1870 Unchecked, 1.2s Time] [2022-11-03 02:34:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2022-11-03 02:34:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 3055. [2022-11-03 02:34:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3055 states, 3054 states have (on average 2.9901768172888015) internal successors, (9132), 3054 states have internal predecessors, (9132), 0 states have call successors, (0), 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:34:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 9132 transitions. [2022-11-03 02:34:59,313 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 9132 transitions. Word has length 31 [2022-11-03 02:34:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:34:59,314 INFO L495 AbstractCegarLoop]: Abstraction has 3055 states and 9132 transitions. [2022-11-03 02:34:59,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 47 states have internal predecessors, (82), 0 states have call successors, (0), 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:34:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 9132 transitions. [2022-11-03 02:34:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:34:59,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:34:59,318 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:34:59,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 02:34:59,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:34:59,519 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:34:59,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:34:59,519 INFO L85 PathProgramCache]: Analyzing trace with hash 500628502, now seen corresponding path program 21 times [2022-11-03 02:34:59,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:34:59,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000534632] [2022-11-03 02:34:59,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:34:59,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:34:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:35:01,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:35:01,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000534632] [2022-11-03 02:35:01,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000534632] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:35:01,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805598853] [2022-11-03 02:35:01,114 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:35:01,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:01,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:01,115 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:01,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 02:35:01,257 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:35:01,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:35:01,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 02:35:01,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:01,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:01,287 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 26 treesize of output 24 [2022-11-03 02:35:01,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:35:01,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:01,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:35:02,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:35:02,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:02,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:02,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 16 [2022-11-03 02:35:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:35:02,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:03,412 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 02:35:03,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 221 [2022-11-03 02:35:03,482 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:03,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 165 treesize of output 153 [2022-11-03 02:35:03,507 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:03,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 96 treesize of output 103 [2022-11-03 02:35:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:35:05,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805598853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:05,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1565075519] [2022-11-03 02:35:05,661 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:35:05,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:35:05,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 49 [2022-11-03 02:35:05,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641778109] [2022-11-03 02:35:05,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:35:05,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-03 02:35:05,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:35:05,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-03 02:35:05,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=2152, Unknown=34, NotChecked=0, Total=2450 [2022-11-03 02:35:05,664 INFO L87 Difference]: Start difference. First operand 3055 states and 9132 transitions. Second operand has 50 states, 50 states have (on average 1.7) internal successors, (85), 49 states have internal predecessors, (85), 0 states have call successors, (0), 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:35:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:43,002 INFO L93 Difference]: Finished difference Result 10769 states and 30312 transitions. [2022-11-03 02:35:43,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2022-11-03 02:35:43,003 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 49 states have internal predecessors, (85), 0 states have call successors, (0), 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:35:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:43,027 INFO L225 Difference]: With dead ends: 10769 [2022-11-03 02:35:43,027 INFO L226 Difference]: Without dead ends: 9382 [2022-11-03 02:35:43,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 19266 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=7602, Invalid=43431, Unknown=269, NotChecked=0, Total=51302 [2022-11-03 02:35:43,032 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1307 mSDsluCounter, 2130 mSDsCounter, 0 mSdLazyCounter, 4018 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 9107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 4018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4606 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:43,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 17 Invalid, 9107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 4018 Invalid, 0 Unknown, 4606 Unchecked, 4.1s Time] [2022-11-03 02:35:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9382 states. [2022-11-03 02:35:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9382 to 3355. [2022-11-03 02:35:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 3354 states have (on average 2.981216457960644) internal successors, (9999), 3354 states have internal predecessors, (9999), 0 states have call successors, (0), 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:35:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 9999 transitions. [2022-11-03 02:35:43,149 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 9999 transitions. Word has length 31 [2022-11-03 02:35:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:43,149 INFO L495 AbstractCegarLoop]: Abstraction has 3355 states and 9999 transitions. [2022-11-03 02:35:43,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 49 states have internal predecessors, (85), 0 states have call successors, (0), 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:35:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 9999 transitions. [2022-11-03 02:35:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:35:43,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:43,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:43,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:43,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-03 02:35:43,355 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:35:43,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:43,355 INFO L85 PathProgramCache]: Analyzing trace with hash -491932356, now seen corresponding path program 22 times [2022-11-03 02:35:43,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:35:43,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105663281] [2022-11-03 02:35:43,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:43,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:35:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:35:44,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:35:44,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105663281] [2022-11-03 02:35:44,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105663281] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:35:44,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230462692] [2022-11-03 02:35:44,887 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:35:44,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:44,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:44,891 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:44,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 02:35:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:45,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 02:35:45,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:45,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:45,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-03 02:35:45,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:35:45,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:35:45,783 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:45,783 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 47 treesize of output 13 [2022-11-03 02:35:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:35:45,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:46,072 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1183 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1183) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:35:46,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1183 (Array Int Int))) (< (+ c_~d~0 |c_thread2Thread1of1ForFork2_~temp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1183) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-11-03 02:35:46,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1182))) (let ((.cse0 (select .cse2 c_~queue~0.base))) (or (< (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1183) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) (+ c_~W~0 1)) (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) is different from false [2022-11-03 02:35:46,238 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1182))) (let ((.cse0 (select .cse2 c_~queue~0.base))) (or (< (let ((.cse1 (* c_~front~0 4))) (+ c_~d~0 (select .cse0 (+ c_~queue~0.offset .cse1)) (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1183) c_~queue~0.base) (+ c_~queue~0.offset .cse1 4)))) (+ c_~W~0 1)) (not (= (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))) 1)))))) (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|))) is different from false [2022-11-03 02:35:46,272 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:46,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 556 treesize of output 491 [2022-11-03 02:35:46,287 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 410 treesize of output 354 [2022-11-03 02:35:46,307 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:35:46,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 379 treesize of output 322 [2022-11-03 02:35:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 5 not checked. [2022-11-03 02:35:47,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230462692] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:47,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1722657201] [2022-11-03 02:35:47,105 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:35:47,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:35:47,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 46 [2022-11-03 02:35:47,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937722432] [2022-11-03 02:35:47,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:35:47,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 02:35:47,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:35:47,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 02:35:47,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1646, Unknown=4, NotChecked=340, Total=2162 [2022-11-03 02:35:47,108 INFO L87 Difference]: Start difference. First operand 3355 states and 9999 transitions. Second operand has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:36:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:36:04,234 INFO L93 Difference]: Finished difference Result 9679 states and 26880 transitions. [2022-11-03 02:36:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-11-03 02:36:04,235 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:36:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:36:04,254 INFO L225 Difference]: With dead ends: 9679 [2022-11-03 02:36:04,254 INFO L226 Difference]: Without dead ends: 8813 [2022-11-03 02:36:04,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 49 SyntacticMatches, 21 SemanticMatches, 173 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 10977 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=4219, Invalid=24860, Unknown=7, NotChecked=1364, Total=30450 [2022-11-03 02:36:04,256 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 933 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 4087 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 6124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 4087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1739 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:36:04,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 28 Invalid, 6124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 4087 Invalid, 0 Unknown, 1739 Unchecked, 3.5s Time] [2022-11-03 02:36:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8813 states. [2022-11-03 02:36:04,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8813 to 3289. [2022-11-03 02:36:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 3288 states have (on average 2.9625912408759123) internal successors, (9741), 3288 states have internal predecessors, (9741), 0 states have call successors, (0), 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:36:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 9741 transitions. [2022-11-03 02:36:04,416 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 9741 transitions. Word has length 31 [2022-11-03 02:36:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:36:04,416 INFO L495 AbstractCegarLoop]: Abstraction has 3289 states and 9741 transitions. [2022-11-03 02:36:04,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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:36:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 9741 transitions. [2022-11-03 02:36:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:36:04,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:36:04,425 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:36:04,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-03 02:36:04,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 02:36:04,651 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:36:04,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:36:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash 562930340, now seen corresponding path program 23 times [2022-11-03 02:36:04,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:36:04,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231729909] [2022-11-03 02:36:04,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:36:04,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:36:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:36:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:36:06,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:36:06,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231729909] [2022-11-03 02:36:06,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231729909] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:36:06,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204173721] [2022-11-03 02:36:06,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:36:06,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:36:06,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:36:06,154 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:36:06,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 02:36:06,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:36:06,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:06,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-03 02:36:06,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:06,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:06,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:36:07,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:07,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:36:07,424 INFO L356 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-11-03 02:36:07,424 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 47 treesize of output 16 [2022-11-03 02:36:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:36:07,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:08,451 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 02:36:08,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 540 treesize of output 479 [2022-11-03 02:36:08,468 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 398 treesize of output 350 [2022-11-03 02:36:08,504 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-11-03 02:36:08,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 375 treesize of output 324 [2022-11-03 02:36:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:36:10,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204173721] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:36:10,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [653546705] [2022-11-03 02:36:10,322 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:36:10,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:36:10,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 46 [2022-11-03 02:36:10,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648162749] [2022-11-03 02:36:10,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:36:10,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 02:36:10,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:36:10,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 02:36:10,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1893, Unknown=10, NotChecked=0, Total=2162 [2022-11-03 02:36:10,328 INFO L87 Difference]: Start difference. First operand 3289 states and 9741 transitions. Second operand has 47 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 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:36:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:36:48,706 INFO L93 Difference]: Finished difference Result 10550 states and 28831 transitions. [2022-11-03 02:36:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2022-11-03 02:36:48,706 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 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:36:48,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:36:48,721 INFO L225 Difference]: With dead ends: 10550 [2022-11-03 02:36:48,721 INFO L226 Difference]: Without dead ends: 9483 [2022-11-03 02:36:48,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 61 SyntacticMatches, 32 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18701 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=7078, Invalid=36221, Unknown=173, NotChecked=0, Total=43472 [2022-11-03 02:36:48,723 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1319 mSDsluCounter, 2543 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 10676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6727 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:36:48,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 18 Invalid, 10676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 3642 Invalid, 0 Unknown, 6727 Unchecked, 3.3s Time] [2022-11-03 02:36:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9483 states. [2022-11-03 02:36:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9483 to 3308. [2022-11-03 02:36:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3308 states, 3307 states have (on average 2.9002116722104625) internal successors, (9591), 3307 states have internal predecessors, (9591), 0 states have call successors, (0), 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:36:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 9591 transitions. [2022-11-03 02:36:48,869 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 9591 transitions. Word has length 31 [2022-11-03 02:36:48,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:36:48,870 INFO L495 AbstractCegarLoop]: Abstraction has 3308 states and 9591 transitions. [2022-11-03 02:36:48,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 46 states have internal predecessors, (85), 0 states have call successors, (0), 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:36:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 9591 transitions. [2022-11-03 02:36:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:36:48,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:36:48,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:36:48,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-03 02:36:49,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-03 02:36:49,099 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-03 02:36:49,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:36:49,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1501861256, now seen corresponding path program 24 times [2022-11-03 02:36:49,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:36:49,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556273047] [2022-11-03 02:36:49,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:36:49,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:36:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:36:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:36:50,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:36:50,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556273047] [2022-11-03 02:36:50,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556273047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:36:50,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603623235] [2022-11-03 02:36:50,375 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:36:50,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:36:50,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:36:50,376 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:36:50,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_257e0cdf-53c7-42fc-a907-4fcabc17d699/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 02:36:50,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:36:50,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:36:50,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-03 02:36:50,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:50,681 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:36:50,750 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:36:51,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:51,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:36:51,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:36:51,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 02:36:51,671 INFO L356 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-11-03 02:36:51,671 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 47 treesize of output 16 [2022-11-03 02:36:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:36:51,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:36:51,997 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1286 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1286) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) (+ c_~W~0 1))) is different from false [2022-11-03 02:36:53,178 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:53,179 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 120 treesize of output 84 [2022-11-03 02:36:53,247 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 02:36:53,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 15408 treesize of output 13836 [2022-11-03 02:36:53,360 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 02:36:53,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 13784 treesize of output 12602 [2022-11-03 02:36:53,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:36:53,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12532 treesize of output 10102 [2022-11-03 02:36:53,522 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 9974 treesize of output 8182